Limit laws for sums of functions of subtrees of random binary search trees

SIAM Journal on Computing

Volumn 32, Issue 1, 2003, Pages 152-171

  Devroye, Luc ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Binary search tree; Convergence; Data structures; Limit law; Probabilistic analysis; Random trees; Stein's method; Toll functions

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; NORMAL DISTRIBUTION; RANDOM PROCESSES; THEOREM PROVING;

CENTRAL LIMIT THEOREMS; CONVERGENCE TOLL FUNCTIONS; LIMIT LAW; PROBABILISTIC ANALYSIS; RANDOM BINARY SEARCH TREES; STEIN METHOD;

DATA STRUCTURES;

EID: 0037783432     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701383923     Document Type: Article

References (31)

1. D. Aldous (1991), Asymptotic fringe distributions for general families of random trees, Ann. Appl. Probab., 1, pp. 228-266.
2. R. C. Bradley (1981), Central limit theorems under weak dependence, J. Multivariate Anal., 11, pp. 1-16.
3. B. M. Brown (1971), Martingale central limit theorems, Annals of Mathematical Statistics, 42, pp. 59-66.
4. L. H. Y. Chen (1978), Two central limit problems for dependent random variables, Z. Wahrsch. Verw. Gebiete, 43, pp. 223-243.
5. L. Devroye (1986), A note on the height of binary search trees, J. ACM, 33, pp. 489-498.
6. L. Devroye (1987), Branching processes in the analysis of the heights of trees, Acta Inform., 24, pp. 277-298.
7. L. Devroye (1988), Applications of the theory of records in the study of random trees, Acta Inform., 26, pp. 123-130.
8. L. Devroye (1991), Limit laws for local counters in random binary search trees, Random Structures Algorithms, 2, pp. 303-316.
9. A. Dvoretzky (1972), Central limit theorems for dependent random variables, in Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, CA, 1972, pp. 513-535.
10. J. A. Fill (1996), On the distribution of binary search trees under the random permutation model, Random Structures Algorithms, 8, pp. 1-25.
11. P. Flajolet, X. Gourdon, and C. Martinez (1997), Patterns in random binary search trees, Random Structures Algorithms, 11, pp. 223-244.
12. G. H. Gonnet (1984), Handbook of Algorithms and Data Structures, Addison-Wesley, Reading, MA.
13. P. Grabner and H. Prodinger (2001), Sorting algorithms for broadcast communications: Mathematical analysis, Theoret. Comput. Sci., to appear.
14. P. Hall and C. C. Heyde (1980), Martingale Limit Theory and Its Applications, Academic Press, New York.
15. W. Hoeffding and H. Robbins (1949), The central limit theorem for dependent random variables, Annals of Mathematical Statistics, 20, pp. 773-780.
16. H.-K. Hwang and R. Neininger (2001), Phase Change of Limit Laws in Quicksort Recurrence under Varying Toll Functions, Technical report, McGill University, Montreal.
17. I. A. Ibragimov (1975), A note on the central limit theorem for dependent random variables, Theory Probab. Appl., 20, pp. 135-141.
18. S. Janson, T. Luczak, and A. Rucińnski (2000), Random Graphs, John Wiley, New York.
19. D. E. Knuth (1973), The Art of Computer Programming, Addison-Wesley, Reading, MA.
20. D. E. Knuth and A. Schonhage (1978), The expected linearity of a simple equivalence algorithm, Theoret. Comput. Sci., 6, pp. 281-315.
21. W. C. Lynch (1965), More combinatorial problems on certain trees, Computer J., 7, pp. 299-302.
22. H. Mahmoud and B. Pittel (1984), On the most probable shape of a search tree grown from a random permutation, SIAM J. Algebraic Discrete Methods, 5, pp. 69-81.
23. H. M. Mahmoud (1986), The expected distribution of degrees in random binary search trees, Computer J., 29, pp. 36-37.
24. H. M. Mahmoud (1992), Evolution of Random Search Trees, John Wiley, New York.
25. D. L. McLeish (1974), Dependent central limit theorems and invariance principles, Ann. Probab., 2, pp. 620-628.
26. A. Panholzer and H. Prodinger (2001), Binary search tree recursions with harmonic toll functions, J. Comput. Appl. Math., to appear.
27. B. Pittel (1984), On growing random binary trees, J. Math. Anal. Appl., 103, pp. 461-480.
28. J. M. Robson (1979), The height of binary search trees, Austral. Comput. J., 11, pp. 151-153.
29. R. Sedgewick (1983), Mathematical analysis of combinatorial algorithms, in Probability Theory and Computer Science, G. Louchard and G. Latouche, eds., Academic Press, London, pp. 123-205.
30. C. Stein (1972), A bound for the error in the normal approximation to the distribution of a sum of dependent random variables, Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, CA, pp. 583-602.
31. J. S. Vitter and P. Flajolet (1990), Average-case analysis of algorithms and data structures, in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, J. van Leeuwen, ed., Elsevier, Amsterdam, pp. 431-524.