Journal of the ACM (JACM)
Software—Practice & Experience
Randomized algorithms
Analysis of Hoare's FIND algorithm with median-of-three partition
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Introspective sorting and selection algorithms
Software—Practice & Experience
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Introspective sorting and selection revisited
Software—Practice & Experience
SIAM Journal on Computing
An efficient dynamic selection method
Communications of the ACM
Expected time bounds for selection
Communications of the ACM
Algorithm 489: the algorithm SELECT—for finding the ith smallest of n elements [M1]
Communications of the ACM
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Optimal Sampling Strategies in Quicksort and Quickselect
SIAM Journal on Computing
Median Selection Requires $(2+\epsilon)n$ Comparisons
SIAM Journal on Discrete Mathematics
On Lower Bounds for Selecting the Median
SIAM Journal on Discrete Mathematics
Randomized selection in n + C + o(n) comparisons
Information Processing Letters
| Hi-index | 5.23 |
We show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth smallest of n elements require at most n + min{k, n - k} + o (n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. Our computational results confirm that SELECT may be the best algorithm in practice.