Optimal parallel selection has complexity O(Log Log N)
- 1 February 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 38 (1), 125-133
- https://doi.org/10.1016/0022-0000(89)90035-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A parallel median algorithmInformation Processing Letters, 1985
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973