Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Frank Thomson Leighton. Tight Bounds on the Complexity of Parallel Sorting. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, 1984, Washington, D.C., USA. pages 71-80, ACM, 1984.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Tight Bounds on the Complexity of Parallel SortingFrank Thomson Leighton. TC, 34(4):344-354, 1985.
The following publications are possibly variants of this publication: