Optimal parallel selection had complexity O(log log N)

Authors:
Miklós Ajtai;János Komlós;W. L. Steiger;Endre Szemerédi
Affiliations:
-;Univ. of California San Diego, La Jolla, CA;Rutgers Univ., New Brunswick, NJ;Rutgers Univ., New Brunswick, NJ
Venue:
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Year:
1989

A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Matching nuts and bolts in O(n log n) time

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel selection

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Rounds vs queries trade-off in noisy computation

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel selection

ACM Transactions on Algorithms (TALG)

Hi-index	0.00