, Volume 5, Issue 1, pp 75–92

Improved sorting networks withO(logN) depth

  • M. S. Paterson

DOI: 10.1007/BF01840378

Cite this article as:
Paterson, M.S. Algorithmica (1990) 5: 75. doi:10.1007/BF01840378


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.

Key words

Sorting networksComparatorsParallel algorithm

Copyright information

© Springer-Verlag New York Inc. 1990

Authors and Affiliations

  • M. S. Paterson
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryEngland