Journal of the ACM (JACM)
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Randomized algorithms
Multiple Quickselect—Hoare's Find algorithm for several elements
Information Processing Letters
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Optimal Time Minimal Space Selection Algorithms
Journal of the ACM (JACM)
Expected time bounds for selection
Communications of the ACM
A sorting problem and its complexity
Communications of the ACM
Algorithm 410: Partial sorting
Communications of the ACM
Communications of the ACM
Analysis of multiple quickselect variants
Theoretical Computer Science
Journal of Computer and System Sciences
Journal of Computer and System Sciences
An efficient algorithm for partial order production
Proceedings of the forty-first annual ACM symposium on Theory of computing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
An Efficient Algorithm for Partial Order Production
SIAM Journal on Computing
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
The multiple selection problem asks for the elements of rank r1, r2, ..., rk from a linearly ordered set of n elements. Let B denote the information theoretic lower bound on the number of element comparisons needed for multiple selection. We first show that a variant of multiple quickselect — a well known, simple, and practical generalization of quicksort — solves this problem with $B+\mathcal{O}(n)$ expected comparisons. We then develop a deterministic divide-and-conquer algorithm that solves the problem in $\mathcal{O}(B)$ time and $B+o(B)+\mathcal{O}(n)$ element comparisons.