Preview
Unable to display preview. Download preview PDF.
8. References
M. Ajtai, J. Komlós and E. Szemerédi, “Sorting in c log n Parallel Steps”, Combinatorica, 3 (1983) 1–19.
V. E. Alekseev, “Sorting Algorithms with Minimum Memory”, Kibernetica, 5 (1969) 99–103.
L. A. Bassalygo, “Asymptotically Optimal Switching Circuits”, Problems of Info. Transm., 17 (1981) 206–211.
D. E. Knuth, The Art of Computer Programming, v. 3, Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
M. S. Paterson, “Improved Sorting Networks with O(log n) Depth”, Algorithmica, to appear.
N. Pippenger, “Communication Networks”, J. van Leeuwen (editor), Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pippenger, N. (1990). Selection networks. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_50
Download citation
DOI: https://doi.org/10.1007/3-540-52921-7_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52921-7
Online ISBN: 978-3-540-47177-6
eBook Packages: Springer Book Archive