Deterministic selection in O(loglog N) parallel time

Authors:
M Ajtai;J Komlos;W L Steiger;E Szemeredi
Affiliations:
IBM Almaden, Research Center;Mathematics, Univ. of California, San Diego;Computer Science, Rutgers Univ.;Mathematical Institute, Hungarian Academy of Sciences
Venue:
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Year:
1986

Routing, merging and sorting on parallel models of computation

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Comparison-sorting and selecting in totally monotone matrices

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A parallel algorithm for linear programming in fixed dimension

Proceedings of the eleventh annual symposium on Computational geometry
Practical Algorithms for Selection on Coarse-Grained Parallel Computers

IEEE Transactions on Parallel and Distributed Systems
Parallel Implementations of the Selection Problem: A Case Study

International Journal of Parallel Programming
Practical Algorithms for Selection on Coarse-Grained Parallel Computers

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Partially effective randomization in simulations between arbitrary and common PRAMs

Journal of Parallel and Distributed Computing
Recursive construction for 3-regular expanders

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The complexity of parallel comparison merging

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Hi-index	0.00