%0 Journal Article %1 leighton85 %A Leighton, Tom %D 1985 %I IEEE %J IEEE Transactions on Computers %K algorithm complexity parallel sorting %N 4 %P 344--354 %R 10.1109/tc.1985.5009385 %T Tight Bounds on the Complexity of Parallel Sorting %V C-34

@article{leighton85, added-at = {2016-11-06T09:02:17.000+0100}, author = {Leighton, Tom}, biburl = {https://www.bibsonomy.org/bibtex/22f0934e948533711482408f49b5d3883/ytyoun}, doi = {10.1109/tc.1985.5009385}, interhash = {f9d02a7f027ba756fb146653ad6681dc}, intrahash = {2f0934e948533711482408f49b5d3883}, journal = {{IEEE} Transactions on Computers}, keywords = {algorithm complexity parallel sorting}, month = apr, number = 4, pages = {344--354}, publisher = {IEEE}, timestamp = {2016-11-08T09:19:35.000+0100}, title = {Tight Bounds on the Complexity of Parallel Sorting}, volume = {C-34}, year = 1985 }