Enumeration of binary trees and universal types

Discrete Mathematics and Theoretical Computer Science

Volumn 7, Issue 1, 2005, Pages 313-400

  Knessl, Charles ^a   Szpankowski, Wojciech ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b Purdue University   (United States)

Author keywords

Binary trees; Lempel Ziv'78; Path length; Types

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; FUNCTIONS; STATISTICS;

BINARY TREES; CATALAN NUMBERS; PATH LENGTH;

DATA STRUCTURES;

EID: 29844453105     PISSN: 13658050     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Review

References (27)

1. M. Abramowitz, and I. Stegun, Handbook of Mathematical Functions, Dover, New York, 1964.
2. G. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press, 1999.
3. C. Bender and S. Orszag, Advanced Mathematical Methods for Scientists and Engineers, Mc-Graw Hill, 1978.
4. I. Csiszár, and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press, New York, 1981.
5. M. Csorgo, Z. Shi, and M. Yor, Some Asymptotic Properties of the Local Time of the Uniform Empirical Processes, Bernoulli, 5, 1035-1058, 1999.
6. P. Flajolet, and A. Odlyzko, The Average Height of Binary Trees and Other Simple Trees, J. Computer and System Sciences, 25, 171-213, 1982.
7. P. Flajolet and G. Louchard, Analytic Variations on the Airy Distribution, Algorithmica, 361-377, 2001.
8. P. Flajolet, P. Poblete, and A. Viola, On the Analysis of Linear Probing Hashing, Algorithmica, 22, 490-515, 1998.
9. P. Flajolet and R. Sedgewick, Analytical Combinatorics, in preparation; see also INRIA TR-1888 1993, TR-2026 1993 and TR-2376 1994.
10. P. Hennequin, Combinatorial Analysis of Quicksort Algorithm, Theoretical Informatics and Applications, 23, 317-333, 1989.
11. P. Jacquet, and W. Szpankowski, Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees, Theoretical Computer Science, 144, 161-197, 1995.
12. P. Jacquet and W. Szpankowski, Precise Worst Case Minimax Redundancy for Markov Sources IEEE Trans. Information Theory, 50, 2004.
13. C. Knessl and W. Szpankowski, Quicksort algorithm again revisited, Discrete Math. Theor. Comput. Sci., 3 43-64, 1999.
14. C. Knessl and W. Szpankowski, Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme, SIAM J. Computing, 30, 923-964, 2000.
15. D. E. Knuth, The Art of Computer Programming. Fundamental Algorithms, Vol. 1, Third Edition, Addison-Wesley, Reading, MA, 1997.
16. D. E. Knuth, Linear Probing and Graphs, Algorithmica, 22, 561-568, 1998.
17. D. E. Knuth, Selected Papers on the Analysis of Algorithms, Cambridge University Press, Cambridge, 2000.
18. G. Louchard, Kac's Formula, Levy Local Time and Brownian Excursion, J. Appl. Probab., 21, 479-499, 1984.
19. G. Louchard, The Brownian Excursion Area: A Numerical Analysis, Comp. & Maths, with Appls., 10, 413-417, 1984.
20. M. Régnier, A Limiting Distribution for Quicksort, Theoretical Informatics and Applications, 23, 335-343, 1989.
21. U. Rösler, A Limit Theorem for Quicksort, Theoretical Informatics and Applications, 25, 85-100, 1991.
22. G. Seroussi, On Universal Types, IEEE Trans. Information Theory, 52, 2006.
23. G. Seroussi, On the Number of t-ary Trees with a Given Pathlength, Algorithmica, 2006.
24. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, John Wiley & Sons, New York, 2001.
25. L. Takács, A Bernoulli Excursion and its Various Applications, J. Appl. Probab., 23, 557-585, 1991.
26. L. Takács, Conditional Limit Theorems for Branching Processes, J. Applied Mathematics and Stochastic Analysis, 4, 263-292, 1991.
27. L. Takács, The Asymptotic Distribution of the Total Heights of Random Rooted Trees, Acta Sci. Math. (Szegad), 57, 613-625, 1993.