Spanning tree size in random binary search trees

Annals of Applied Probability

Volumn 14, Issue 2, 2004, Pages 718-733

  Panholzer, Alois ^a,c   Prodinger, Helmut ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF THE WITWATERSRAND   (South Africa)

^c INSTITUT FÜR DISKRETE MATHEMATIK UND GEOMETRIE   (Austria)

Author keywords

Binary search trees; Limiting distribution; Multiple Quickselect; Quasi power theorem; Spanning tree size

Indexed keywords

EID: 11144346279     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051604000000071     Document Type: Article

References (9)

1. DOBROW, R. (1996). On the distribution of distances in recursive trees. J. Appl. Probab. 33 749-757.
2. FLAJOLET, PH. and ODLYZKO, A. (1990). Singularity analysis of generating functions. SIAM J. Discrete Math. 3 216-240.
3. GREENE, D. and KNUTH, D. (1982). Mathematics for the Analysis of Algorithms, 2nd ed. Birkhäuser, Boston.
4. HWANG, H.-K. (1998). On convergence rates in the central limit theorems for combinatorial structures. European J. Combin. 19 329-343.
5. JANSON, S. (2003). The Wiener index of simply generated random trees. Random Structures and Algorithms 22 337-358.
6. MAHMOUD, H. (1992). Evolution of Random Search Trees. Wiley, New York.
7. MAHMOUD, H. and NEININGER, R. (2003). Distribution of distances in random binary search trees. Ann. Appl. Probab. 13 253-276.
8. NEININGER, R. (2002). The Wiener index of random trees. Combin. Probab. Comput. 11 587-597.
9. PANHOLZER, A. and PRODINGER, H. (1998). A generating functions approach for the analysis of grand averages for Multiple QUICKSELECT. Random Structures Algorithms 13 189-209.