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.
@inproceedings{Leighton84:0, title = {Tight Bounds on the Complexity of Parallel Sorting}, author = {Frank Thomson Leighton}, year = {1984}, researchr = {https://researchr.org/publication/Leighton84%3A0}, cites = {0}, citedby = {0}, pages = {71-80}, booktitle = {Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, 1984, Washington, D.C., USA}, publisher = {ACM}, }