Analysis of quickselect : an algorithm for order statistics
Open Access
- 1 January 1995
- journal article
- research article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 29 (4) , 255-276
- https://doi.org/10.1051/ita/1995290402551
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsThis publication has 11 references indexed in Scilit:
- A limit theorem for “quicksort”RAIRO - Theoretical Informatics and Applications, 1991
- A limiting distribution for quicksortRAIRO - Theoretical Informatics and Applications, 1989
- Combinatorial analysis of quicksort algorithmRAIRO - Theoretical Informatics and Applications, 1989
- Exponential bounds for the running time of a selection algorithmJournal of Computer and System Sciences, 1984
- Probability TheoryPublished by Springer Nature ,1978
- Quicksort with Equal KeysSIAM Journal on Computing, 1977
- Inequalities for E k(X, Y) when the marginals are fixedProbability Theory and Related Fields, 1976
- QuicksortThe Computer Journal, 1962
- Algorithm 64: QuicksortCommunications of the ACM, 1961
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952