S. Arya, M. Golin, and K. Mehlhorn, On the Expected Depth of Random Circuits, Combinatorics, Probability and Computing, vol.8, issue.3, pp.209-228, 1999.
DOI : 10.1017/S096354839900382X

A. Barabasi and R. Albert, Emergence of scaling in random networks, Science, vol.286, pp.509-512, 1999.

H. Chernoff, A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations, The Annals of Mathematical Statistics, vol.23, issue.4, pp.493-507, 1952.
DOI : 10.1214/aoms/1177729330

K. Chung and P. Erd?-os, On the application of the Borel-Cantelli lemma. Transactions of the, pp.179-186, 1952.

H. Cramér, Sur un nouveau th??or??me-limite de la th??orie des probabilit??s, Actualités Scientifiques et Industrielles, vol.736, pp.5-23, 1938.
DOI : 10.1007/978-3-642-40607-2_8

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

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

. Devroye, Applications of the theory of records in the study of random trees, Acta Informatica, vol.11, issue.1-2, pp.123-130, 1988.
DOI : 10.1007/BF02915448

L. Devroye and S. Janson, Long and short paths in uniform random recursive dags, Arkiv f??r Matematik, vol.49, issue.1, 2009.
DOI : 10.1007/s11512-009-0118-0

L. Devroye and J. Lu, The strong convergence of maximal degrees in uniform random recursive trees and dags. Random Structures and Algorithms, pp.1-14, 1995.

L. Devroye and B. Reed, On the Variance of the Height of Random Binary Search Trees, SIAM Journal on Computing, vol.24, issue.6, pp.1157-1162, 1995.
DOI : 10.1137/S0097539792237541

L. Devroye, O. Fawzi, and N. Fraiman, Depth properties of scaled attachment Random recursive trees. Manuscript submitted for publication, 2010.

M. Drmota, Random trees: an interplay between combinatorics and probability, 2009.
DOI : 10.1007/978-3-211-75357-6

R. M. Souza, P. L. Krapivsky, and C. Moore, The power of choice in growing trees, The European Physical Journal B, vol.12, issue.4, pp.535-543, 2007.
DOI : 10.1140/epjb/e2007-00310-5

M. Dwass, The total progeny in a branching process and a related random walk, Journal of Applied Probability, vol.1, issue.03, pp.682-686, 1969.
DOI : 10.1007/BF00531752

J. L. Gastwirth, A probability model of a pyramid scheme. The American Statistician, pp.79-82, 1977.

W. Hoeffding, Probability Inequalities for Sums of Bounded Random Variables, Journal of the American Statistical Association, vol.1, issue.301, pp.13-30, 1963.
DOI : 10.1214/aoms/1177730491

H. Mahmoud, The Power of Choice in the Construction of Recursive Trees, Methodology and Computing in Applied Probability, vol.51, issue.4, 2009.
DOI : 10.1007/s11009-009-9159-x

H. Mahmoud, Limiting Distributions for Path Lengths in Recursive Trees, Probability in the Engineering and Informational Sciences, pp.53-59, 1991.
DOI : 10.1007/BF02915448

H. Mahmoud, Distances in random plane-oriented recursive trees, Journal of Computational and Applied Mathematics, vol.41, issue.1-2, pp.237-245, 1992.
DOI : 10.1016/0377-0427(92)90252-S

J. Moon, The distance between nodes in recursive trees, pp.125-132, 1974.
DOI : 10.1017/CBO9780511662072.019

H. Na and A. Rapoport, Distribution of nodes of a tree by degree, Mathematical Biosciences, vol.6, pp.313-329, 1970.
DOI : 10.1016/0025-5564(70)90071-4

S. Ross, Stochastic processes, 1996.

R. Smythe and H. Mahmoud, A survey of recursive trees, Theory of Probability and Mathematical Statistics, pp.1-27, 1995.

J. Szyma´nskiszyma´nski, On a nonuniform random recursive tree In Random Graphs' 85: Based on Lectures Presented at the 2nd International Seminar on Random Graphs and Probabilistic Methods in Combinatorics, pp.297-306, 1987.

T. Tsukiji and F. Xhafa, On the depth of randomly generated circuits, Proceedings of Fourth European Symposium on Algorithms, pp.208-220, 1996.
DOI : 10.1007/3-540-61680-2_57