A limit theorem for “quicksort”
Open Access
- 1 January 1991
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 25 (1) , 85-100
- https://doi.org/10.1051/ita/1991250100851
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsKeywords
This publication has 11 references indexed in Scilit:
- A limiting distribution for quicksortRAIRO - Theoretical Informatics and Applications, 1989
- Combinatorial analysis of quicksort algorithmRAIRO - Theoretical Informatics and Applications, 1989
- A moment estimate for rank statisticsJournal of Statistical Planning and Inference, 1985
- Exponential bounds for the running time of a selection algorithmJournal of Computer and System Sciences, 1984
- On the invariance principle for sums of independent identically distributed random variablesJournal of Multivariate Analysis, 1978
- Inequalities for E k(X, Y) when the marginals are fixedProbability Theory and Related Fields, 1976
- Some performance tests of “quicksort” and descendantsCommunications of the ACM, 1974
- Samplesort: A Sampling Approach to Minimal Storage Tree SortingJournal of the ACM, 1970
- QuicksortThe Computer Journal, 1962
- Algorithm 64: QuicksortCommunications of the ACM, 1961