A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks

@inproceedings{Plaxton1994ASL,
  title={A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks},
  author={C. Greg Plaxton and Torsten Suel},
  booktitle={ICALP},
  year={1994}
}
Hypercubic sorting networks are a class of comparator networks whose structure maps eeciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic sorting networks with depth 2 O(p lg lg n) lg n have been discovered. These networks are the only known sorting networks of depth o(lg 2 n) that are not based on expanders, and their existence raises the question of whether a depth of O(lg n) can be achieved by any hypercubic sorting network. In this paper, we resolve… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Sorting Networks and Their Applications

AFIPS Spring Joint Computing Conference • 1968
View 4 Excerpts
Highly Influenced

A super-logarithmic lower bound for hypercubic sorting networks

C. G. Plaxton, T. Suel
Technical Report TR{94{08, • 1994
View 1 Excerpt

Theoretical Aspects of VLSI Pin Limitations

SIAM J. Comput. • 1993
View 2 Excerpts

Similar Papers

Loading similar papers…