no. 1
A limit theorem for “quicksort”
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 1, pp. 85-100 
@article{ITA_1991__25_1_85_0,
     author = {R\"osler, Uwe},
     title = {A limit theorem for {\textquotedblleft}quicksort{\textquotedblright}},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {85--100},
     year = {1991},
     publisher = {EDP Sciences},
     volume = {25},
     number = {1},
     mrnumber = {1104413},
     zbl = {0718.68026},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1991__25_1_85_0/}
}
TY  - JOUR
AU  - Rösler, Uwe
TI  - A limit theorem for “quicksort”
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
SP  - 85
EP  - 100
VL  - 25
IS  - 1
PB  - EDP Sciences
UR  - https://www.numdam.org/item/ITA_1991__25_1_85_0/
LA  - en
ID  - ITA_1991__25_1_85_0
ER  - 
%0 Journal Article
%A Rösler, Uwe
%T A limit theorem for “quicksort”
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 85-100
%V 25
%N 1
%I EDP Sciences
%U https://www.numdam.org/item/ITA_1991__25_1_85_0/
%G en
%F ITA_1991__25_1_85_0
Rösler, Uwe. A limit theorem for “quicksort”. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 1, pp. 85-100. https://www.numdam.org/item/ITA_1991__25_1_85_0/

1. S. Cambanis, G. Simon and W. Stout, Inequalities for Ek (X, Y) when the Marginals are Fixed, Zeitschrift für Wahrscheinlichkeistheorie und verwandte Gebiete, 1976, 36, pp. 285-294. | Zbl | MR

2. M. Denker and U. Rösler, A Moment Estimate for Rank Statistics, Journal of Statistical Planning and Interference, 1985, 12, pp. 269-284. | Zbl | MR

3. L. Devroye, Exponential Bounds for the Running Time of a Selection Algorithm, Journal of Computer and System Sciences, 1985, 29, pp. 1-7. | Zbl | MR

4. N. Dunford and J. Schwartz, Linear Operators I, John Wiley & Sorts, 1963.

5. W. D. Frazer and A. C. Mckellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, Journal of the Association for Computing Machinery, 1970, 17, pp. 496-507. | Zbl | MR

6. P. Hennequin, Combinatorial Analysis of Quicksort Algorithm, Informatique théorique et Applications/Theoretical Informatics and Applications, 1989, 23, pp. 317-333. | Zbl | MR | Numdam

7. C. A. R. Hoare, Algorithm 64: Quicksort, Communications of the Association for Computing Machinery, 1961, 4, p. 321.

8. C. A. R. Hoare, Quicksort, Computer Journal, 1962, 5, pp. 10-15. | Zbl | MR

9. D. E. Knuth, The art of computer programming, 3, Sorting and searching, M. A. Reading, Addison-Wesley, 1973. | MR

10. R. Loeser, Some Performance Tests of "Quicksort" and Descendants, Communications of the Association for Computing Machinery 1974, 17, pp. 143-152.

11. P. Major, On the invariance principle for sums of independent identically distributed random variables, Journal of Multivariate Analysis, 1978, 8, pp. 487-517. | Zbl | MR

12. M. Régnier, A Limit Distribution for Quicksort, Informatique théorique et Applications/Theoretical Informatics and Applications, 1989, 23, pp. 335-343. | Zbl | MR | Numdam

13. R. Sedgewick, The analysis of Quicksort programs, Acta Informatica, 1977, 7, pp. 327-355. | Zbl | MR

14. R. Sedgewick, Quicksort, Stanford Computer Science Report STAN-CS-75-492, Ph. d. thesis, 1975, Also published by Garland, Pub. Co., New York, 1980.

15. R. Sedgewick, Algorithms, Addison-Wesley, second edition, 1988. | Zbl