Journal of the ACM Bibliography
Andrew Chi-Chih Yao and Foong Frances Yao.
Lower bounds on merging networks. Journal of the ACM,
23(3):566-571, July 1976.
[BibTeX entry]
Selected papers that cite this one
- Nabil Kahale, Tom Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, and
Endre Szemerédi. Lower bounds for
sorting networks. In Proceedings of the Twenty-Seventh Annual
ACM Symposium on the Theory of Computing, pages 437-446, Las
Vegas, Nevada, 29 May-1 June 1995.
- T. Leighton, Y. Ma, and T. Suel. On probabilistic
networks for selection, merging, and sorting. Theory of
Computing Systems, 30(6):559-582, November/December 1997.
- Peter Bro Miltersen, Mike Paterson, and Jun Tarui. The asymptotic complexity of
merging networks. Journal of the ACM, 43(1):147-165,
January 1996.
Shortcuts: