Total Path Length for Random Recursive Trees

Combinatorics Probability and Computing

Volumn 8, Issue 4, 1999, Pages 317-333

  Dobrow, Robert P ^a   Fill, James Allen ^b  

^a TRUMAN STATE UNIVERSITY   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033440049     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399003855     Document Type: Article

References (20)

1. Chung, K. L. (1974) A Course in Probability Theory, 2nd edn, Academic Press, Orlando, FL.
2. Dobrow, R. P. and Smythe, R. T. (1996) Poisson approximation for functionals of random trees. Random Struct. Alg. 9 79-92.
3. Elderton, W. P. and Johnson, N. L. (1969) Systems of Frequency Curves, Cambridge University Press, Cambridge.
4. Fill, J. A. (1996) On the distribution of binary search trees under the random permutation model. Random Struct. Alg. 8 1-25.
5. Flajolet, P. and Odlyzko, A. M. (1990) Singularity analysis of generating functions. SIAM J. Discrete Math. 3 216-240.
6. Hennequin, P. (1991) Analyse en moyenne d'algorithmes, tri rapide et arbres de recherche. PhD dissertation, L'École Polytechnique Palaiseau.
7. Hoare, C. A. (1962) Quicksort. Computer J. 5 10-15.
8. Kendall, M. G. and Stuart, A. (1963) The Advanced Theory of Statistics, Vol. 1 Charles Griffin & Co., Ltd., London.
9. Knuth, D. (1973) The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd edn, Addison Wesley, Reading, MA.
10. Mahmoud, H. (1991) Limiting distributions for path lengths in recursive trees. Probab. Eng. Inform. Sci. 5 53-59.
11. Moon, J. W. (1974) The distance between nodes in recursive trees. In Vol. 13 of London Math. Soc. Lecture Notes, Cambridge University Press, pp. 125-132.
12. Régnier, M. (1989) A limit distribution for Quicksort. Inform. Theor. Appl. 23 335-343.
13. Rösler, U. (1991) A limit theorem for Quicksort. Inform. Theor. Appl. 25 85-100.
14. Smythe, R. T. and Mahmoud, H. (1995) A survey of recursive trees. Theo. Probab. Math. Statist. 51 1-27.
15. Solomon, H. and Stephens, M. A. (1980) Approximations to densities in geometric probability. J. Appl. Probab. 17 145-153.
16. Stanley, R. P. (1986) Enumerative Combinatorics Vol. I, Wadsworth & Brooks/Cole, Monterey, CA.
17. Szymański, J. (1990) On the complexity of algorithms on recursive trees. Theo. Comput. Sci. 74 355-361.
18. Takács, L. (1992) On the total heights of random rooted trees. J. Appl. Probab. 29 543-556.
19. Takács, L. (1994) On the total heights of random rooted binary trees. J. Comput. Theory Ser. B 61 155-166.
20. Tan, K. H. and Hadjicostas, P. (1995) Some properties of a limiting distribution in Quicksort. Statist. Probab. Letters 25 87-94.