Perfect simulation from the quicksort limit distribution

Electronic Communications in Probability

Volumn 5, Issue , 2000, Pages 95-99

  Devroye, Luc ^a   Allen Fill, James ^b   Neininger, Ralph ^c  

^a MCGILL UNIVERSITY   (Canada)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002643194     PISSN: None     EISSN: 1083589X     Source Type: Journal    
DOI: 10.1214/ECP.v5-1024     Document Type: Article

References (9)

1. Cramer, M. 1996, A note concerning the limit distribution of the quicksort algorithm. RAIRO, Theoretical Informatics and Applications 30, 195-207.
2. Devroye, L. 1986, Nonuniform Random Variate Generation. Springer-Verlag, New York. Devroye, L. 1999, Simulating perpetuities. Preprint.
3. Fill, J. A. 1996, On the distribution for binary search trees under the random permutation model. Random Structures and Algorithms 8, 1-25.
4. Fill, J. A. and Janson, S. 2000, Smoothness and decay properties of the limiting Quicksort density function. Refereed article, to apppear in a book edited by D. Gardy and A. Mokkadem, published in 2000 by Birkhauser, and based on the Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities (University of Versailles-St. Quentin, Versailles, France, September, 2000). Preprint available from http://www.mts.jhu.edu/fill/.
5. Fill, J. A. and Janson, S. 2000, Quicksort asymptotics. Unpublished manuscript.
6. Hennequin, P. 1989, Combinatorial analysis of quicksort algorithm. RAIRO, Theoretical Informatics and Applications 23, 317-333.
7. Regnier, M. 1989, A limiting distribution for quicksort. RAIRO, Theoretical Informatics and Applications 23, 335-343.
8. Rosler, U. 1991, A limit theorem for “Quicksort”. RAIRO, Theoretical Informatics and Applications 25, 85-100.
9. Tan, K. H. and Hadjicostas, P. 1995, Some properties of a limiting distribution in Quicksort. Statistics & Probability Letters 25, 87-94.