X. Campi, H. Krivine, N. Sator, and E. Plagnol, Analyzing fragmentation of simple fluids with percolation theory, The European Physical Journal D, vol.11, issue.2, p.233, 2000.
DOI : 10.1007/s100530070088
URL : https://hal.archives-ouvertes.fr/hal-00003673

L. Devroye, Branching processes in the analysis of the heights of trees, Acta Informatica, vol.24, issue.3, pp.277-298, 1987.
DOI : 10.1007/BF00265991

L. Devroye, A note on the height of binary search trees, Journal of the ACM, vol.33, issue.3, pp.489-498, 1986.
DOI : 10.1145/5925.5930

B. Derrida and H. Flyvbjerg, Statistical properties of randomly broken objects and of multivalley structures in disordered systems, Journal of Physics A: Mathematical and General, vol.20, issue.15, p.5273, 1987.
DOI : 10.1088/0305-4470/20/15/039

P. L. Krapivsky, I. Grosse, and E. Ben-naim, Stable distributions in stochastic fragmentation, Journal of Physics A: Mathematical and General, vol.37, issue.8, pp.2863-2880, 2004.
DOI : 10.1088/0305-4470/37/8/002

B. R. Lawn and T. R. Wilshaw, Fracture of Brittle Solids, 1975.
DOI : 10.1017/CBO9780511623127

R. Neininger and L. Rschendorf, A general limit theorem for recursive algorithms and combinatorial structures, Ann. Appl. Probab, vol.14, pp.378-418, 2004.

R. Neininger, On a multivariate contraction method for random recursive structures with applications to Quicksort, Random Structures and Algorithms, vol.25, issue.3-4, pp.498-524, 2001.
DOI : 10.1002/rsa.10010

S. Rachev and L. Rüschendorf, Probability metrics and recursive algorithms, Advances in Applied Probability, vol.II, issue.03, pp.770-799, 1995.
DOI : 10.1214/aop/1176992167
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.7623

S. T. Rachev, Probability Metrics and the Stability of Stochastic Models, 1991.

U. Rsler, On the analysis of stochastic divide and conquer algorithms, Algorithmica, vol.7, issue.1-2, pp.238-261, 2001.
DOI : 10.1007/BF02679621

S. Rednerfor, Statistical Models for the Fracture of Disordered Media, 1990.

U. Rösler and L. Rüschendorf, The contraction method for recursive algorithms, Algorithmica, vol.25, issue.2, pp.3-33, 2001.
DOI : 10.1007/BF02679611

U. Rsler, A limit theorem for ???quicksort???, RAIRO - Theoretical Informatics and Applications, vol.25, issue.1, pp.85-100, 1991.
DOI : 10.1051/ita/1991250100851

M. Sibuya and Y. Itoh, Random sequential bisection and its associated binary tree, Annals of the Institute of Statistical Mathematics, vol.33, issue.4, 1987.
DOI : 10.1007/BF02491450

J. Svante and R. Neininger, The size of random fragmentation trees, 2007.

V. M. Zolotarev, Ideal metrics in the problem of approximating the distributions of sums of independent random variables (Russian), Teor. Verojatnost. i Primenen, vol.22, pp.449-465, 1977.