Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- 31 August 1996
- journal article
- Published by Elsevier in Statistics & Probability Letters
- Vol. 28 (4) , 299-310
- https://doi.org/10.1016/0167-7152(95)00139-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- How Many Comparisons Does Quicksort Use?Journal of Algorithms, 1995
- Analysis of quickselect : an algorithm for order statisticsRAIRO - Theoretical Informatics and Applications, 1995
- Limit laws for local counters in random binary search treesRandom Structures & Algorithms, 1991
- A limiting distribution for quicksortRAIRO - Theoretical Informatics and Applications, 1989
- Combinatorial analysis of quicksort algorithmRAIRO - Theoretical Informatics and Applications, 1989
- Algorithm 489: the algorithm SELECT—for finding the i th smallest of n elements [M1]Communications of the ACM, 1975
- Small Sample Behavior of Some Robust Linear Estimators of LocationJournal of the American Statistical Association, 1970
- Sequential Confidence Intervals Based on Rank TestsThe Annals of Mathematical Statistics, 1970
- Randomized binary search techniqueCommunications of the ACM, 1969
- QuicksortThe Computer Journal, 1962