Tight bounds on the complexity of parallel sorting

Tom Leighton
1984 Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84  
As a service to our readers, SIGACT News has reached an agreement to reprint reviews that originally appeared in Computing Reviews of books and articles of interest to the theoretical computer science community . Computing Reviews is a monthly journa l that publishes critical reviews on a broad range of computing subjects, including model s of computation, formal languages, computational complexity theory, analysis of algorithms, and logics and semantics of programs . ACM members can receive a
more » ... ubscriptio n to Computing Reviews for $32 per year by writing to ACM headquarters . AJTAI, M .; KOMLOS, J . ; AND SZEMEREDI, E . Sorting in c log n parallel steps.
doi:10.1145/800057.808667 dblp:conf/stoc/Leighton84 fatcat:hcgpsyo5qfb2fhnycpx6b6yblu