D. Aldous, The Continuum random tree II: an overview, London Mathematical Society Lecture Note Series, pp.23-70, 1991.
DOI : 10.1017/CBO9780511662980.003

P. Chassaing and R. Marchand, Cutting a random tree (and union-find algorithms) Talk at the " 8th Seminar on the Analysis of Algorithms, Strobl, 2002.

M. Fisz, Probability Theory and Mathematical Statistics, 1963.

P. Flajolet and M. Noy, Analytic combinatorics of non-crossing configurations, Discrete Mathematics, vol.204, issue.1-3, pp.203-229, 1999.
DOI : 10.1016/S0012-365X(98)00372-0

URL : https://hal.archives-ouvertes.fr/inria-00073493

A. [. Flajolet and . Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.216-240, 1990.
DOI : 10.1137/0403019

URL : https://hal.archives-ouvertes.fr/inria-00075725

J. [. Meir and . Moon, Cutting down random trees, Journal of the Australian Mathematical Society, vol.38, issue.03, pp.313-324, 1970.
DOI : 10.1112/jlms/s1-33.4.471

J. Marckert and A. Panholzer, Noncrossing trees are almost conditioned galton-watson trees. Random Structures and Algorithms, pp.115-125, 2002.

]. A. Pan02 and . Panholzer, The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. submitted, 2002.

]. A. Pan03 and . Panholzer, Cutting down very simple trees. submitted, 2003.