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.
No references recorded for this publication.
No citations of this publication recorded.