Random records and cuttings in binary search trees

Combinatorics Probability and Computing

Volumn 19, Issue 3, 2010, Pages 391-424

  Holmgren, Cecilia ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC DISTRIBUTIONS; BINARY SEARCH TREES; CLASSICAL LIMITS; INFINITELY DIVISIBLE DISTRIBUTIONS; TRIANGULAR ARRAYS;

BINARY TREES;

TREES (MATHEMATICS);

EID: 77951256942     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S096354830999068X     Document Type: Article

References (19)

1. Chauvin, B., Drmota, M. and Jabbour Hattab, J. (2001) The profile of binary search trees. Ann. Applied Probab. 11 1042-1062.
2. Devroye, L. (1986) A note on the height of binary search trees. J. Assoc. Comput. Mach. 33 489-498.
3. Devroye, L. (1998) Branching processes and their applications in the analysis of tree structures and tree algorithms. In Probabilistic Methods for Algorithmic Discrete Mathematics, Vol.16 (Habib et al., eds), Springer, Berlin, pp. 249-314.
4. Devroye, L. (2005) Applications of Stein's method in the analysis of random binary search trees. In Stein's Method and Applications (Chen and Barbour, eds), Vol.5 of Inst. for Math. Sci. Lect. Notes Ser., World Scientific, Singapore, pp. 47-297.
5. Drmota, M., Iksanov, A., Moehle, M. and Roesler, U. (2009) A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. Random Struct. Alg. 34 319-336.
6. Fill, J. A. and Janson, S. (2002) Quicksort asymptotics. J. Algorithms 44 4-28.
7. Feller, W. (1971) An Introduction to Probability Theory and Its Applications, Vol.II, 2nd edn, Wiley, New York.
8. Gut, A. (2005) Probability: A Graduate Course, Springer, New York.
9. Holmgren, C. (2008) Random records and cuttings in split trees: Extended abstract. Discrete Math. Theor. Comput. Sci. (DMTCS Proceedings) AI, 269-282.
10. Holmgren, C. (2009) A weakly 1-stable limiting distribution for the number of random records and cuttings in split trees. Submitted.
11. Iksanov, A. and Moehle, M. (2007) A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree. Electron. Commun. Prob. 12 28-35.
12. Janson, S. (2004) Random records and cuttings in complete binary trees. In Mathematics and Computer Science III, Birkhäuser, Basel, pp. 241-253.
13. Janson, S. (2006) Random cuttings and records in deterministic and random trees. Random Struct. Alg. 29 139-179.
14. Janson, S., Luczak, T. and Ruciń ski, A. (2000) Random Graphs, Wiley, New York.
15. Kallenberg, O. (2002) Foundations of Modern Probability, 2nd edn, Springer.
16. Knessl, C. and Szpankowski, W. (1999) Quicksort algorithm again revisited. Discrete Math. Theor. Comput. Sci. no.2 43-64.
17. Knuth, D. E. (1997) The Art of Computer Programming I: Fundamental Algorithms, 3rd edn, Addison-Wesley.
18. Knuth, D. E. (2002) The Art of Computer Programming III: Sorting and Searching, Addison- Wesley.
19. Meir, A. and Moon, J. W. (1970) Cutting down random trees. J. Australian Math. Soc. 11 313-324.