On the number of t-ary trees with a given path length

Algorithmica (New York)

Volumn 46, Issue 3-4, 2006, Pages 557-565

  Seroussi, Gadiel ^a  

^a MATHEMATICAL SCIENCES RESEARCH INSTITUTE   (United States)

Author keywords

Binary trees; Path length; T Ary trees; Universal types

Indexed keywords

ARY TREES; BINARY TREES; PATH LENGTHS;

GLOSSARIES; INFORMATION THEORY; NUMBER THEORY;

TREES (MATHEMATICS);

EID: 33846887611     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0122-8     Document Type: Conference Paper

References (14)

1. C. Bender and S. Orszag, Advanced. Mathematical Methods for Scientists and Engineers, McGraw-Hill, New York, 1978.
2. R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth, On the Lambert W function, Adv. Comput. Math., 5 (1996), 329-359.
3. I. Csiszár, The method of types, IEEE Trans. Inform. Theory, 44 (1998), 2505-2523.
4. P. Flajolet and G. Louchard, Analytic variations on the Airy distribution, Algorithmica, 31 (2001), 361-377.
5. P. Flajolet and A. M. Odlyzko, The average height of binary trees and other simple trees, J. Comput. System Sci., 25 (1982), 171-213.
6. C. Knessl and W. Szpankowski, Enumeration of binary trees, Lempel-Ziv78 parsings, and universal types, in Proc. of the Second Workshop on Analytic Algorithmic and Combinatorics (ANALCO05), Vancouver, 2005, 222-229.
7. D. E. Knuth, The An of Computer Programming. Fundamental Algorithms, vol. 1, third edn., Addison-Wesley, Reading, MA, 1997.
8. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland, Amsterdam, 1983.
9. G. Seroussi, On universal types, IEEE Trans. Inform. Theory, 52 (2006), 171-189.
10. G. Seroussi, Universal types and simulation of individual sequences, in LATIN 2004: Theoretical Informatics, M. Farach-Colton, ed., LNCS 2976, Springer-Verlag, Berlin, 2004, pp. 312-321.
11. L. Takács, A Bernoulli excursion and its various applications, Adv. Appl. Probab. 23 (1991), 557-585.
12. L. Takács, Conditional limit theorems for branching processes, J, Appl. Math. Stochastic Anal., 4 (1991), 263-292.
13. L. Takács, On a probability problem connected with railway traffic, J. Appl. Math. Stochastic Anal., 4 (1991), 1-27.
14. J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Tians. Inform. Theory, 24 (1978), 530-536.