Improved sorting networks withO(logN) depth

  title={Improved sorting networks withO(logN) depth},
  author={Mike Paterson},
The sorting network described by Ajtaiet al. was the first to achieve a depth ofO(logn). The networks introduced here are simplifications and improvements based strongly on their work. While the constants obtained for the depth bound still prevent the construction being of practical value, the structure of the presentation offers a convenient basis for further development. 
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 101 extracted citations


Publications referenced by this paper.
Showing 1-9 of 9 references


  • M. Ajtai
  • Koml6s, and E. Szemer6di, Sorting in C log N…
  • 1983
Highly Influential
6 Excerpts

Galil , Explicit constructions of linearsized superconcentrators

  • Z.
  • J . Comput . System Sci .
  • 1978

On concentrators

  • F. Chung
  • superconcentrators, generalizers, and nonblocking…
  • 1978
1 Excerpt

A remark on Stirling's formula

  • H. Robbins
  • Amer. Math. Monthly, 62
  • 1955
1 Excerpt

Similar Papers

Loading similar papers…