A characterization of the set of fixed points of the quicksort transformation

Electronic Communications in Probability

Volumn 5, Issue , 2000, Pages 77-84

  Fill, James Allen ^a   Janson, Svante ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (10)

1. Chung, K. L. A Course in Probability Theory. Second edition. Academic Press, New York, 1974.
2. Durrett, R. and Liggett, T. M. Fixed points of the smoothing transformation. Z. Wahrsch. Verw. Gebiete 64 (1983), 275-301.
3. Fill, J. A. and Janson, S. Smoothness and decay properties of the limiting Quicksort density function. Refereed article, to apppear in a book edited by D. Gardy and A. Mokka-dem, 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/ or http://www.math.uu.se/svante/.
4. Guivarc’h, Y. Sur une extension de la notion de loi semi-stable. Ann. Inst. H. Poincare Probab. Statist. 26 (1990), 261-285.
5. Knessl, C. and Szpankowski, W. Quicksort algorithm again revisited. Discrete Math. Theor. Comput. Sci. 3 (1999), 43-64.
6. Liu, Q. Fixed points of a generalized smoothing transformation and applications to the branching random walk. Adv. in Appl. Probab. 30 (1998), 85-112.
7. Rosler, U. A limit theorem for ‘Quicksort’. RAIRO Inform. Theor. Appl. 25 (1991), 85-100.
8. Rosler, U. A fixed point theorem for distributions. Stochastic Process. Appl. 42 (1992), 195-214.
9. Rosler, U. The analysis of stochastic divide and conquer algorithms. Algorithmica (1999), to appear.
10. Rosler, U. and Ruschendorf, L. The contraction method for recursive algorithms. Algorithmica (1999), to appear.