Preview
Unable to display preview. Download preview PDF.
References
M. Abramowitz, I. A. Stegun, Handbook of Mathematical Functions, Dover, New York, 1970.
N. G. de Bruijn, D. E. Knuth, S. O. Rice, The average height of planted plane trees, Graph Theory and Computing (R. C. Read, eds.), Academic Press, New York, 1972, pp. 15–22.
P. Flajolet, J.-C. Raoult, J. Vuillemin, The number of registers required for evaluating arithmetic expressions, Theor. Comput. Sci. 9 (1979), 99–125.
P. Flajolet and H. Prodinger, Register allocation for unary-binary Trees, SIAM Journal on Computing 15 (1986), 629–640.
P. Flajolet and A. Odlyzko, Singularity analysis of generating functions, SIAM J. Disc. Math. 3 (1990), 216–240.
R. Kemp, The average number of registers to evaluate a binary tree optimally, Acta Informatica 11 (1979), 363–372.
A. Meir, J. W. Moon and J. A. Pounder, On the order of random channel networks, SIAM J. on Alg. Disc. Meth. 1 (1980), 25–33.
H. Prodinger, Die Bestimmung gewisser Parameter von binären Bäumen mit Hilfe analytischer Methoden, Lecture Notes in Mathematics (E. Hlawka, Ed.) 1114 (1985), 118–133, Springer Verlag.
H. Prodinger, Some Recent Results on the Register Function of a Binary Tree, Proceedings of the Second Conference on Random Graphs, Posen 1985, Annals of Discrete Mathematics 33 (1987), 241–260.
H. Prodinger, Quelques techniques analytiques pour l'étude asymptotique des paramètres dans les arbres, (Lecture notes for the summer school in Ilde Ré), English version in: EATCS Bulletin 47 (1992), 180–199 (1983).
E. T. Whittaker, G. N. Watson, A course in modern analyis, Cambridge University Press, 1930.
I. Yekutieli and B. Mandelbrot, Horton-Strahler ordering of random binary trees, J. Phys. A: Math. Gen. 27 (1994), 285–293.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prodinger, H. (1995). Solution of a problem of yekutieli and mandelbrot. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_110
Download citation
DOI: https://doi.org/10.1007/3-540-59175-3_110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59175-7
Online ISBN: 978-3-540-49220-7
eBook Packages: Springer Book Archive