On the number of descendants and ascendants in random search trees

Electronic Journal of Combinatorics

Volumn 5, Issue 1, 1998, Pages

  Martínez, Conrado ^a   Panholzer, Alois ^b   Prodinger, Helmut ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10044266639     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1358     Document Type: Article

References (36)

1. G.M. Adel'son-Vel'skii and E.M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2):263-266, 1962. English translation in Soviet Math. Doklay 3 ,1962, 1259-1263.
2. G.M. Adel'son-Vel'skii and E.M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2):263-266, 1962. English translation in Soviet Math. Doklay 3 ,1962, 1259-1263.
3. C.R. Aragon and R.G. Seidel. Randomized search trees. In Proc. of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 540-545, 1989.
4. S.R. Arora and W.T. Dent. Randomized binary search technique. Comm. ACM, 12(2):77-80, 1969.
5. C.J. Bell. An Investigation into the Principles of the Classification and Analysis of Data on an Automatic Digital Computer. PhD thesis, Leeds University, 1965.
6. G.G. Brown and B.O. Shubert. On random binary trees. Mathematics of Operations Research, 9(1):43-65, 1984.
7. Ph. Flajolet and A.M. Odlyzko. Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics, 3(2):216-240, May 1990.
8. Ph. Flajolet and R. Sedgewick. The Average Case Analysis of Algorithms: Multivariate Asymptotics and Limit Distributions. Rapport de recherche de l'INRIA #3162, 1997.
9. Ph. Flajolet and M. Soria. General combinatorial schemas: Gaussian limit distributions and exponential tails. Discrete Mathematics, 114, 1993.
10. G.H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures - In Pascal and C. Addison-Wesley, 2nd edition, 1991.
11. R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989.
12. L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. of the 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 8-21, 1978.
13. C.A.R. Hoare. Find (Algorithm 65). Comm. ACM, 4:321-322, 1961.
14. C.A.R. Hoare. Quicksort. Comput. J., 5:10-15, 1962.
15. M. Hoshi and Ph. Flajolet. Page usage in a quadtree index. BIT, 32(3):384-402, 1992.
16. H.-K. Hwang. Théorèmes limites pour les structures combinatoires et les fonctions arithmétiques. PhD thesis, Ecole Polytechnique, 1994.
17. E. Kamke. Differentialgleichungen: Lösungsmethoden und Lösungen. Teubner, Stuttgart, 1977.
18. P. Kirschenhofer, C. Martínez, and H. Prodinger. Analysis of Hoare's Find Algorithm with Median-of-three partition. Random Structures & Algorithms, 10:143-156, 1997.
19. P. Kirschenhofer and H. Prodinger. Comparisons in Hoare's Find algorithm. Combinatorics, Probability and Computing, 7:111-120, 1998.
20. D.E. Knuth. Mathematical analysis of algorithms. In Proc. of the 1971 IFIP Congress, pages 19-27, Amsterdam, 1972. North-Holland.
21. D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, 1973.
22. J. Lent. Probabilistic analysis of some searching and sorting algorithms. PhD thesis, George Washington University, 1996.
23. G. Louchard. Exact and asymptotic distributions in digital and binary search trees. Theoretical Informatics and Applications, 21(4):479-496, 1987.
24. W.C. Lynch. More combinatorial properties of certain trees. Comput. J., 7:299-302, 1965.
25. H.M. Mahmoud. Evolution of Random Search Trees. Wiley Interscience, 1992.
26. A. Panholzer. Untersuchungen zur durchschnittlichen Gestalt gewisser Baumfamilien. Mit besonderer Berücksichtigung von Anwendungen in der Informatik. PhD thesis, Technische Universität Wien, 1997.
27. P.V. Poblete. The analysis of heuristics for search trees. Acta Informatica, 30:233-248, 1993.
28. P.V. Poblete and J.I. Munro. The analysis of a fringe heuristic for binary search trees. J. Algorithms, 6:336-350, 1985.
29. S. Roura and C. Martínez. Randomization of search trees by subtree size. In J. Díaz and M. Serna, editors, Proc. of the 4th European Symposium on Algorithms (ESA), volume 1136 of LNCS, pages 91-106. Springer, 1996.
30. B. Salvy and P. Zimmermann. Gfun: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Transactions on Mathematical Software, 20(2):163-177, 1994.
31. R. Sedgewick. Quicksort. Garland, New York, 1978.
32. R. Sedgewick. Algorithms in C. Addison-Wesley, 3rd edition, 1997.
33. R. Sedgewick and Ph. Flajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley, 1996.
34. J.S. Vitter and Ph. Flajolet. Average-case analysis of algorithms and data structures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 9. North-Holland, 1990.
35. A. Walker and D. Wood. Locally balanced binary trees. Comput. J., 19(4):322-325, 1976.
36. H. Wilf. Generatingfunctionology. Academic Press, 1990.