D. J. Aldous, The Continuum Random Tree. I, The Annals of Probability, vol.19, issue.1, pp.1-28, 1991.
DOI : 10.1214/aop/1176990534

D. J. Aldous, The continuum random tree II: an overview, Stochastic Analysis, pp.23-70, 1991.

D. J. Aldous, The Continuum Random Tree III, The Annals of Probability, vol.21, issue.1, pp.248-289, 1993.
DOI : 10.1214/aop/1176989404

D. Aldous and P. Diaconis, Hammersley's interacting particle process and longest increasing subsequences, Probability Theory and Related Fields, vol.18, issue.2, pp.199-213, 1995.
DOI : 10.1007/BF01204214

D. Aldous and P. Shields, A diffusion limit for a class of randomly-growing binary trees, Probability Theory and Related Fields, vol.23, issue.4, pp.509-542, 1988.
DOI : 10.1007/BF00318784

N. Alon and M. Krivelevich, The concentration of the chromatic number of random graphs, Combinatorica, vol.7, issue.3, pp.303-313, 1997.
DOI : 10.1007/BF01215914

N. Alon and J. H. Spencer, The probabilistic method, 2000.

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

J. Beardwood, H. J. Halton, and J. M. Hammersley, The shortest path through many points, Proc. Cambridge Phil. Soc, pp.55-299, 1959.
DOI : 10.2307/2031707

F. Bergeron, P. Flajolet, and B. Salvy, Varieties of increasing trees, Rennes Lecture Notes in Comput. Sci, vol.581, pp.92-116, 1992.
DOI : 10.1007/3-540-55251-0_2
URL : https://hal.archives-ouvertes.fr/inria-00074977

J. Baik, P. Deift, and K. Johansson, On the distribution of the length of the longest increasing subsequence of random permutations, Journal of the American Mathematical Society, vol.12, issue.04, pp.1119-1178, 1999.
DOI : 10.1090/S0894-0347-99-00307-0

B. Bollobás, The distribution of the maximum degree of a random graph, pp.201-203, 1980.

B. Bollobás, The Diameter of Random Graphs, 14] B. Bollobás, Degree sequences of random graphs, pp.41-52, 1981.
DOI : 10.2307/1998567

B. Bollobás and G. Brightwell, The Height of a Random Partial Order: Concentration of Measure, The Annals of Applied Probability, vol.2, issue.4, pp.1009-1018, 1992.
DOI : 10.1214/aoap/1177005586

B. Bollobás, F. De, and . Vega, The diameter of random regular graphs, Combinatorica, vol.12, issue.2, pp.125-134, 1982.
DOI : 10.1007/BF02579310

B. Bollobás and O. Riordan, The Diameter of a Scale-Free Random Graph, Combinatorica, vol.24, issue.1, pp.5-34, 2004.
DOI : 10.1007/s00493-004-0002-2

B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, The degree sequence of a scale-free random graph process, Random Struct, Algorithms, vol.18, pp.279-290, 2001.

S. Boucheron, G. Lugosi, and O. Bousquet, Concentration Inequalities, Lecture Notes in Computer Science, vol.105, 2004.
DOI : 10.1007/978-1-4757-2440-0
URL : https://hal.archives-ouvertes.fr/hal-00751496

. D. Ju and . Burtin, Asymptotic estimates of the diameter and the independence and domination numbers of a random graph, Dokl. Akad. Nauk SSSR, vol.209, pp.765-768, 1973.

. D. Ju and . Burtin, Extremal metric characteristics of a random graph. I., Teor, Verojatnost. i Primenen, vol.19, pp.740-754, 1974.

R. Carr, W. M. Goh, and E. Schmutz, The maximum degree in a random tree an related problems, Random Struct, Algorithms, vol.5, pp.13-24, 1994.

B. Chauvin and M. Drmota, The random multisection problem, travelling waves, and the distribution of the height of m-ary search trees, Algorithmica, 2006.

B. Chauvin, M. Drmota, and J. Jabbour-hattab, The Profile of Binary Search Trees, The Annals of Applied Probability, vol.11, issue.4, pp.1042-1062, 2001.
DOI : 10.1214/aoap/1015345394

H. Chern, H. Hwang, and T. Tsai, An asymptotic theory for Cauchy???Euler differential equations with applications to the analysis of algorithms, Journal of Algorithms, vol.44, issue.1, pp.177-225, 2002.
DOI : 10.1016/S0196-6774(02)00208-0

N. G. De-bruijn, D. E. Knuth, and S. O. Rice, The average height of planted plane trees, Graph Theory Comput, pp.15-22, 1972.

E. Deutsch, A. J. Hildebrand, H. S. Wilf, and #. R12, Longest increasing subsequences in pattern-restricted permutations, Electr, J. Combinat, vol.9, 2003.

L. Devroye, A probabilistic analysis of the height of tries and of the complexity of triesort, Acta Informatica, vol.11, issue.3, pp.229-237, 1984.
DOI : 10.1007/BF00264248

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, Universal Asymptotics for Random Tries and PATRICIA Trees, Algorithmica, vol.42, issue.1, pp.11-29, 2005.
DOI : 10.1007/s00453-004-1137-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.2132

L. Devroye, Universal Limit Laws for Depths in Random Trees, SIAM Journal on Computing, vol.28, issue.2, pp.409-432, 1999.
DOI : 10.1137/S0097539795283954
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.2724

L. Devroye and H. Hwang, Width and mode of the profile for some random trees of logarithmic height, The Annals of Applied Probability, vol.16, issue.2, pp.886-918, 2006.
DOI : 10.1214/105051606000000187

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

M. Drmota, An analytic approach to the height of binary search trees II, Journal of the ACM, vol.50, issue.3, pp.333-374, 2003.
DOI : 10.1145/765568.765572

M. Drmota, The height of increasing trees, manuscript, 2006.

M. Drmota, Height and saturation level of digital search trees, manuscript, 2006.

M. Drmota and B. Gittenberger, On the profile of random trees, Random Struct, Algorithms, vol.10, pp.421-451, 1997.

M. Drmota and B. Gittenberger, The width of Galton-Watson trees, Discr. Math. Theoret. Comput. Sci, vol.6, pp.387-400, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00959015

M. Drmota and B. Gittenberger, The height and profile of Pólya trees, manuscript, 2006.

M. Drmota and H. Hwang, Profile of random trees: correlation and width of random recursive trees and binary search trees, Adv. Appl. Prob, vol.37, pp.1-21, 2005.

D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms
DOI : 10.1017/CBO9780511581274

P. Erd?-os and G. Szekeres, A combinatorial theorem in geometry, Composition Math, vol.2, pp.463-470, 1935.

P. Flajolet, On the performance evaluation of extendible hashing and trie searching, Acta Informatica, vol.20, issue.4, pp.345-359, 1983.
DOI : 10.1007/BF00264279

P. Flajolet, Z. Gao, A. M. Odlyzko, and B. Richmond, The Distribution of Heights of Binary Trees and Other Simple Trees, Combinatorics, Probability and Computing, vol.30, issue.02, pp.145-156, 1993.
DOI : 10.1016/0377-0427(91)90197-R
URL : https://hal.archives-ouvertes.fr/inria-00076989

P. Flajolet and A. M. Odlyzko, The average height of binary trees and other simple trees, Journal of Computer and System Sciences, vol.25, issue.2, pp.171-213, 1982.
DOI : 10.1016/0022-0000(82)90004-6
URL : https://hal.archives-ouvertes.fr/inria-00076505

P. Flajolet and A. M. 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

A. M. Frieze, On the independence number of random graphs, Discrete Math, pp.81-171, 1990.

A. Frieze, On the Length of the Longest Monotone Subsequence in a Random Permutation, The Annals of Applied Probability, vol.1, issue.2, pp.301-305, 1991.
DOI : 10.1214/aoap/1177005939

W. M. Goh and E. Schmutz, Unlabeled trees: Distribution of the maximum degree, Random Struct, Algorithms, vol.5, pp.411-440, 1994.

W. M. Goh and E. Schmutz, Limit distribution for the maximum degree of a random recursive tree, Journal of Computational and Applied Mathematics, vol.142, issue.1, pp.61-82, 2002.
DOI : 10.1016/S0377-0427(01)00460-5

G. Grimmet and C. Mcdiarmid, On colouring random graphs, Proc. Camb, pp.313-324, 1975.
DOI : 10.1093/comjnl/10.1.85

G. I. Ivchenko, On the Asymptotic Behavior of Degrees of Vertices in a Random Graph, Theory of Probability & Its Applications, vol.18, issue.1
DOI : 10.1137/1118020

. Appl, ); translation from Teor, Veroyatn. Primen, vol.18, issue.18, pp.188-195, 1973.

S. Janson, T. ?uczak, and A. Ruci´nskiruci´nski, Random graphs, 2000.
DOI : 10.1002/9781118032718

K. Johansson, The longest increasing subsequence in a random permutation and a unitary random matrix model, Mathematical Research Letters, vol.5, issue.1, pp.63-82, 1998.
DOI : 10.4310/MRL.1998.v5.n1.a6

R. M. Karp, Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane, Mathematics of Operations Research, vol.2, issue.3, pp.209-244, 1977.
DOI : 10.1287/moor.2.3.209

D. P. Kennedy, The Galton-Watson process conditioned on the total progeny, Journal of Applied Probability, vol.13, issue.04, pp.800-806, 1975.
DOI : 10.2307/1426333

C. Knessl and W. Szpankowski, Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme, SIAM Journal on Computing, vol.30, issue.3, pp.923-964, 2000.
DOI : 10.1137/S0097539799356812

D. E. Knuth, The Art of Computer Programming A variation problem for random Young tableaux, Advances in Math, vol.3, pp.26-206, 1977.

T. ?uczak, Random trees and random graphs, Random Struc, Algoríthms, vol.13, pp.485-500, 1998.

T. ?uczak, A note on the sharp concentration of the chromatic number of random graphs, Combinatorica, vol.7, issue.3, pp.295-297, 1991.
DOI : 10.1007/BF01205080

G. Lugosi, Concentration-of-measure inequalities

H. M. Mahmoud, Evolution of Random Search Trees, 1992.

C. Mcdiarmid, Concentration, Algorithms Combin, vol.16, pp.195-248, 1998.
DOI : 10.1007/978-3-662-12788-9_6

C. Mcdiarmid, On the method of bounded differences, Surveys in Combinatorics, Proceedings, pp.148-188, 1989.
DOI : 10.1017/CBO9781107359949.008

M. L. Mehta, Random matrics, 1991.

A. Meir and J. W. Moon, On the altitude of nodes in random trees, Can, J. Math, vol.30, pp.997-1015, 1978.

A. Meir and J. W. Moon, On nodes of large out-degree in random trees, Proceedings of the Twentysecond Southeastern Conference on Combinatorics, Graph Theory and Computing Congr. Numer, pp.82-85, 1991.

T. F. Mori, The Maximum Degree of the Barab??si???Albert Random Tree, Combinatorics, Probability and Computing, vol.14, issue.03, pp.339-348, 2005.
DOI : 10.1017/S0963548304006133

A. M. Odlyzko and E. M. Rains, On longest increasing subsequences in random permutations, Contemp. Math, pp.439-451, 1998.
DOI : 10.1090/conm/251/03886

R. Otter, The Number of Trees, The Annals of Mathematics, vol.49, issue.3, pp.583-599, 1948.
DOI : 10.2307/1969046

A. Panholzer and H. Prodinger, Level of nodes in increasing trees revisited, Random Structures and Algorithms, vol.29, issue.2
DOI : 10.1002/rsa.20161

G. Pólya, Kombinatorische Anzahlbestimmungen f??r Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, vol.68, issue.0, pp.145-254, 1937.
DOI : 10.1007/BF02546665

B. Reed, The height of a random binary search tree, Journal of the ACM, vol.50, issue.3, pp.306-332, 2003.
DOI : 10.1145/765568.765571

O. Riordan and A. Selby, The Maximum Degree of a Random Graph, Combinatorics, Probability and Computing, vol.9, issue.6, pp.549-572, 2000.
DOI : 10.1017/S0963548300004491

J. M. Robson, The height of binary search trees, Austral. Comput. J, vol.11, pp.151-153, 1979.
URL : https://hal.archives-ouvertes.fr/hal-00307160

J. M. Steele, Complete Convergence of Short Paths and Karp's Algorithm for the TSP, Mathematics of Operations Research, vol.6, issue.3, pp.374-378, 1981.
DOI : 10.1287/moor.6.3.374

J. Szymanski, On the maximum degree and the height of a random recursive tree, Ranndom Graphs 87, pp.313-324, 1990.

T. Seppäläinen, A microscopic model for the Burgers equation and longest increasing subsequences, Electron, J. Prob, vol.1, issue.5, 1996.

E. Shamir and J. H. Spencer, Sharp concentration of the chromatic number on random graphs G n, pp.124-129, 1987.

W. T. Rhee and M. Talagrand, A Sharp Deviation Inequality for the Stochastic Traveling Salesman Problem, The Annals of Probability, vol.17, issue.1, pp.1-8, 1989.
DOI : 10.1214/aop/1176991490

M. Talagrand, Concentration of measure and isoperimetric inequalities in product spaces, Publications math??matiques de l'IH??S, vol.19, issue.158, pp.73-205, 1995.
DOI : 10.1007/BF02699376

S. M. Ulam, Monte Carlo calculations in problems of mathematical physics, in: Modern Mathematics for the Engineers, pp.261-281, 1961.

A. M. Vershik and S. V. Kerov, Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tables, Soviet Math. Dokl, vol.18, pp.527-531, 1977.