Journal of the ACM Bibliography
David E. Muller and Franco P. Preparata. Bounds
to complexities of networks for sorting and for switching. Journal
of the ACM, 22(2):195-201, April 1975.
[BibTeX entry]
Selected papers that cite this one
- J.-C. Birget. Two-way automata and
length-preserving homomorphisms. Mathematical Systems
Theory, 29(3):191-226, May/June 1996.
- Leslie Ann Goldberg, Mark Jerrum, Tom Leighton, and Satish Rao. Doubly
logarithmic communication algorithms for optical-communication parallel
computers. SIAM Journal on Computing, 26(4):1100-1119,
August 1997.
- T. Hagerup and M. Kuty{\l}owski. Fast
integer merging on the EREW PRAM. Algorithmica,
17(1):55-66, January 1997.
- Philip D. MacKenzie and Vijaya Ramachandran. ERCW PRAMs and optical
communication. Theoretical Computer Science,
196(1-2):153-180, 6 April 1998.
- Koji Nakano and Koichi Wada. Integer summing algorithms
on reconfigurable meshes. Theoretical Computer Science,
197(1-2):57-77, 15 May 1998.
- Kenneth W. Regan. Linear time and
memory-efficient computation. SIAM Journal on
Computing, 25(1):133-168, February 1996.
Shortcuts: