Enumeration of binary trees, Lempel-Ziv'78 parsings, and universal types

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2005, Pages 222-229

  Knessl, Charles ^a   Szpankowski, Wojciech ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FUNCTIONS; STATISTICS;

ASYMPTOTICS; PARSING;

DATA STRUCTURES;

EID: 32144445242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

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