The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Expected time bounds for selection
Communications of the ACM
Linear time bounds for median computations
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
ON LOWER BOUNDS FOR SELECTION PROBLEMS
ON LOWER BOUNDS FOR SELECTION PROBLEMS
Finding the Median
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A Unified Lower Bound for Selection and Set Partitioning Problems
Journal of the ACM (JACM)
| Hi-index | 48.22 |
The worst-case, minimum number of comparisons complexity Vi(n) of the i-th selection problem is considered. A new upper bound for Vi(n) improves the bound given by the standard Hadian-Sobel algorithm by a generalization of the Kirkpatrick-Hadian-Sobel algorithm, and extends Kirkpatrick's method to a much wider range of application. This generalization compares favorably with a recent algorithm by Hyafil.