On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees

Theoretical Computer Science

Volumn 181, Issue 1, 1997, Pages 181-194

  Prodinger, Helmut ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BIFURCATION (MATHEMATICS); FUNCTIONS; PROBLEM SOLVING;

BIFURCATION RATIOS; BINARY TREES;

TREES (MATHEMATICS);

EID: 0346676959     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00269-1     Document Type: Article

References (17)

1. M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions (Dover, New York, 1970).
2. N.G. de Bruijn, D.E. Knuth and S.O. Rice, The average height of planted plane trees, in: Graph Theory and Computing (Academic Press, New York, 1972) 15-22.
3. L. Devroye and P. Kruszewski, A note on the Horton-Strahler number for random trees, Information Processing Lett. 52 (1994) 155-159; reprinted in: Inform. Process. Lett. 56 (1995) 95-99.
4. L. Devroye and P. Kruszewski, A note on the Horton-Strahler number for random trees, Information Processing Lett. 52 (1994) 155-159; reprinted in: Inform. Process. Lett. 56 (1995) 95-99.
5. P. Flajolet, X. Gourdon and P. Dumas, Mellin transforms and asymptotics: harmonic sums, Theoret. Comput. Sci. 144 (1995) 3-58.
6. P. Flajolet, J.-C. Raoult and J. Vuillemin, The number of registers required for evaluating arithmetic expressions, Theoret. Comput. Sci. 9 (1979) 99-125.
7. P. Flajolet and H. Prodinger, Register allocation for unary-binary trees, SIAM J. Computing 15 (1986) 629-640.
8. P. Flajolet and A. Odlyzko, Singularity analysis of generating functions, SIAM J. Discretes. Math. 3 (1990) 216-240.
9. P. Flajolet and R. Sedgewick, Analytic Combinatorics (Addison-Wesley, Reading, MA), in preparation.
10. R. Kemp, The average number of registers to evaluate a binary tree optimally, Acta Inform. 11 (1979) 363-372.
11. A. Meir, J.W. Moon and J.A. Pounder, On the order of random channel networks, SIAM J. Algebraic Discrete Methods 1 (1980) 25-33.
12. H. Prodinger, Die Bestimmung gewisser Parameter von binären Bäumen mit Hilfe analytischer Methoden, in: Lecture Notes in Math. Vol. 1114 (Springer, Berlin 1985) 118-133.
13. H. Prodinger, Some recent results on the register function of a binary tree, in: Proc. 2nd Conf. Random Graphs, Posen, 1985, Ann. Discrete Math. 33 (1987) 241-260.
14. H. Prodinger, Quelques techniques analytiques pour l'étude asymptotique des paramètres dans les arbres, Lecture Notes for the Summer School in Ile de Ré, 1983; an English version appears in: EATCS Bull. 47 (1992) 180-199.
15. H. Prodinger, Solution of a problem of Yekutieli and Mandelbrot, in: Latin '95 R. Baeza-Yates, E. Goles, P.V. Poblete eds., Lecture Notes in Computer Science, Vol. 911 (1995) 461-468.
16. E.T. Whittaker and G.N. Watson, A Course in Modern Analysis (Cambridge Univ. Press, Cambridge, Springer, Berlin, 1930).
17. I. Yekutieli and B. Mandelbrot, Horton-Strahler ordering of random binary trees, J. Phys. A. Math. Gen. 27 (1994) 285-293.