zbMATH — the first resource for mathematics

Sorting in \(c \log n\) parallel steps. (English) Zbl 0523.68048

68P10 Searching and sorting
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX Cite
Full Text: DOI
[1] O. Gabber andZ. Galil, Explicit constructions of linear size superconcentrators,Proc. 20st Annual Symposium on Foundations of Computer Science (1979). · Zbl 0487.05045
[2] D. E. Knuth,The art of computer programming Volume 3, Sorting and Searching, Addison–Wesley (1973). · Zbl 0191.17903
[3] G. A. Margulis, Effective construction of expander graphs (in Russian),Probl. Pered. Inf. 9 (4), 71–80. · Zbl 0312.22011
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.