D. Auber, J. Domenger, M. Delest, P. Duchon, and J. Fédou, New Strahler Numbers for Rooted Plane Trees, Mathematics and Computer Science III, pp.203-215, 2004.
DOI : 10.1007/978-3-0348-7915-6_21
URL : https://hal.archives-ouvertes.fr/hal-00308269

P. Biane, J. Pitman, and M. Yor, Probability laws related to the Jacobi theta and Riemann zeta functions, and the Brownian excursions. Bulletin (New series) of the, pp.435-465, 2001.

P. Biane and M. Yor, Valeurs principales associées aux temps locaux browniens, pp.23-101, 1987.

N. G. De-bruijn, D. E. Knuth, and S. O. Rice, THE AVERAGE HEIGHT OF PLANTED PLANE TREES, Graph Theory and Computing, pp.15-22, 1972.
DOI : 10.1016/B978-1-4832-3187-7.50007-6

L. Devroye and P. Kruszewski, On the Horton-Strahler number for random tries, RAIRO - Theoretical Informatics and Applications, vol.30, issue.5, pp.443-456, 1996.
DOI : 10.1051/ita/1996300504431

M. Drmota and H. Prodinger, -ary trees, ACM Transactions on Algorithms, vol.2, issue.3, pp.318-334, 2006.
DOI : 10.1145/1159892.1159894
URL : https://hal.archives-ouvertes.fr/ensl-01408160

A. P. Ershov, On programming of arithmetic operations, Communications of the ACM, vol.1, issue.8, pp.3-6, 1958.
DOI : 10.1145/368892.368907

P. Flajolet, Analyse d'algorithmes de manipulation d'arbres et de fichiers, 1981.

P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, issue.1-2, pp.3-58, 1995.
DOI : 10.1016/0304-3975(95)00002-E
URL : https://hal.archives-ouvertes.fr/inria-00074307

P. Flajolet and H. Prodinger, Register Allocation for Unary???Binary Trees, SIAM Journal on Computing, vol.15, issue.3, pp.629-640, 1986.
DOI : 10.1137/0215046
URL : https://hal.archives-ouvertes.fr/inria-00076292

P. Flajolet and H. Prodinger, Register Allocation for Unary???Binary Trees, SIAM Journal on Computing, vol.15, issue.3, pp.629-640, 1986.
DOI : 10.1137/0215046
URL : https://hal.archives-ouvertes.fr/inria-00076292

P. Flajolet, J. Raoult, and J. Vuillemin, On the average number of registers required for evaluating arithmetic expressions, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.99-125, 1979.
DOI : 10.1109/SFCS.1977.19

P. Hitczenko and G. Louchard, Distinctness of compositions of an integer: A probabilistic analysis, Random Structures and Algorithms, vol.35, issue.3-4, pp.407-437, 2001.
DOI : 10.1002/rsa.10008

R. E. Horton, EROSIONAL DEVELOPMENT OF STREAMS AND THEIR DRAINAGE BASINS; HYDROPHYSICAL APPROACH TO QUANTITATIVE MORPHOLOGY, Geological Society of America Bulletin, vol.56, issue.3, pp.275-370, 1945.
DOI : 10.1130/0016-7606(1945)56[275:EDOSAT]2.0.CO;2

S. Janson, Rounding of continuous random variables and oscillatory asymptotics, The Annals of Probability, vol.34, issue.5, pp.1807-1826, 2006.
DOI : 10.1214/009117906000000232

R. Kemp, The average number of registers needed to evaluate a binary tree optimally, Acta Informatica, vol.17, issue.No. 6, pp.363-37279, 1978.
DOI : 10.1007/BF00289094

P. Kruszewski, A note on the Horton-Strahler number for random binary search trees, Information Processing Letters, vol.69, issue.1, pp.47-51, 1999.
DOI : 10.1016/S0020-0190(98)00192-6

G. Louchard, Brownian motion and algorithm complexity, BIT, vol.10, issue.1, pp.17-34, 1986.
DOI : 10.1007/BF01939359

G. Louchard and H. Prodinger, Asymptotics of the moments of extreme-value related distribution functions . Algorithmica, pp.431-467, 2006.

A. Meir, J. W. Moon, and J. R. Pounder, On the Order of Random Channel Networks, SIAM Journal on Algebraic Discrete Methods, vol.1, issue.1, pp.25-33, 1980.
DOI : 10.1137/0601005

M. Nebel, A unified approach to the analysis of Horton-Strahler parameters of binary tree structures. Random Structures Algorithms, pp.252-277, 2002.

H. Prodinger, Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters, EATCS Bulletin, vol.47, pp.180-199, 1992.

H. Prodinger, On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees, Theoretical Computer Science, vol.181, issue.1, pp.181-194, 1997.
DOI : 10.1016/S0304-3975(96)00269-1

A. N. Strahler, HYPSOMETRIC (AREA-ALTITUDE) ANALYSIS OF EROSIONAL TOPOGRAPHY, Geological Society of America Bulletin, vol.63, issue.11, pp.1117-1142, 1952.
DOI : 10.1130/0016-7606(1952)63[1117:HAAOET]2.0.CO;2

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.
DOI : 10.1002/9781118032770

I. Yekutieli and B. Mandelbrot, Horton-Strahler ordering of random binary trees, Journal of Physics A: Mathematical and General, vol.27, issue.2, pp.285-293, 1994.
DOI : 10.1088/0305-4470/27/2/014