Random trees: An interplay between combinatorics and probability

Random Trees: An Interplay Between Combinatorics and Probability

Volumn , Issue , 2009, Pages 1-458

  Drmota, Michael ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891383107     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-211-75357-6     Document Type: Book

References (209)

1. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Rev. Mod. Phys., 74:47-97, 2002.
2. D. Aldous. The continuum random tree. I. Ann. Probab., 19(1):1-28, 1991.
3. D. Aldous. The continuum random tree. II: An overview. Stochastic analysis, Proc. Symp., Durham/UK 1990, Lond. Math. Soc. Lect. Note Ser. 167, 23-70 (1991)., 1991.
4. D. Aldous. The continuum random tree. III. Ann. Probab., 21(1):248-289, 1993.
5. D. Aldous. Tree-based models for random distribution of mass. J. Stat. Phys., 73(3-4):625-641, 1993.
6. E. A. Bender. Central and local limit theorems applied to asymptotic enumeration. J. Combin. Theory Ser. A, 15:91-111, 1973.
7. E. A. Bender. Asymptotic methods in enumeration. SIAM Review, 16(4):485-515, 1974.
8. E. A. Bender and E. R. Canfield. Face sizes of 3-polytopes. J. Combin. Theory Ser. B, 46(1):58-65, 1989.
9. E. A. Bender, Z. Gao, and N. C. Wormald. 2-connected labelled planar graphs. Elec. J. Combinatorics, 9(#43), 2002.
10. E. A. Bender and L. B. Richmond. Central and local limit theorems applied to asymptotic enumeration. II. Multivariate generating functions. J. Combin. Theory Ser. A, 34(3):255-265, 1983.
11. E. A. Bender and L. B. Richmond. The asymptotic enumeration of rooted convex polyhedra. J. Combin. Theory Ser. B, 36(3):276-283, 1984.
12. F. Bergeron, P. Flajolet, and B. Salvy. Varieties of increasing trees. In CAAP'92 (Rennes, 1992), volume 581 of Lecture Notes in Comput. Sci., pages 24-48. Springer, Berlin, 1992.
13. N. Bernasconi, K. Panagiotou, and A. Steger. On properties of random dissections and triangulations. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), pages 132-141.
14. N. Bernasconi, K. Panagiotou, and A. Steger. On the degree sequences of random outerplanar and series-parallel graph. In Proceedings of the 12th International Workshop on Randomized Techniques in Computation (RANDOM'08), LNCS 5171, Springer Verlag, pages 303-316, 2008.
15. P. Biane and M. Yor. Valeurs principales associées aux temps locaux browniens. Bull. Sci. Math. (2), 111(1):23-101, 1987.
16. P. J. Bickel and D. A. Freedman. Some asymptotic theory for the bootstrap. Ann. Statist., 9(6):1196-1217, 1981.
17. P. Billingsley. Probability and measure. John Wiley & Sons Inc., New York, second edition, 1986.
18. P. Billingsley. Convergence of probability measures. John Wiley & Sons Inc., New York, second edition, 1999.
19. M. Bodirsky, E. Fusy, M. Kang, and S. Vigerske. Enumeration and asymptotic properties of unlabeled outerplanar graphs. Electronic J. Combinat., 14:R66.
20. M. Bodirsky, O. Giménez, M. Kang., and M. Noy. Enumeration and limit laws for series-parallel graphs. European J. Combin., 28(8):2091-2105, 2007.
21. B. Bollobás. Random graphs. Cambridge University Press, Cambridge, second edition, 2001.
22. N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer. Planar graphs, via well-orderly maps and trees. Graphs and Combinatorics, 22:185-202, 2006.
23. M. Bousquet-Mélou. Limit laws for embedded trees: applications to the integrated super-Brownian excursion. Random Structures Algorithms, 29(4):475-523, 2006.
24. M. Bousquet-Mélou and S. Janson. The density of the ISE and local limit laws for embedded trees. Ann. Appl. Probab., 16(3):1597-1632, 2006.
25. J. Bouttier, P. Di Francesco, and E. Guitter. Geodesic distance in planar graphs. Nucl. Phys., B, 663(3):535-567, 2003.
26. J. Bouttier, P. Di Francesco, and E. Guitter. Statistics of planar graphs viewed from a vertex: A study via labeled trees. Nucl. Phys., B, 675(3):631-660, 2003.
27. N. Broutin, L. Devroye, E. McLeish, and M. De La Salle. The height of increasing trees. Random Structures Algorithms, 32:494-518, 2008.
28. N. Broutin and P. Flajolet. The height of random binary unlabelled trees. In Fifth Colloquium on Mathematics and Computer Science (2008), Discrete Math. Theor. Comput. Sci. Proc., AC.
29. W. G. Brown. Enumeration of quadrangular dissections on the disk. Can. J. Math., 17:302-317, 1965.
30. W. G. Brown and W. T. Tutte. On the enumeration of rooted non-separable planar maps. Can. J. Math., 16:572-577, 1964.
31. E. R. Canfield. Remarks on an asymptotic method in combinatorics. J. Combin. Theory Ser. A, 37:348-352, 1984.
32. R. Carr, W. M. Y. Goh, and E. Schmutz. The maximum degree in a random tree an related problems. Random Structures Algorithms, 5:13-24, 1994.
33. P. Chassaing and J.-F. Marckert. Parking functions, empirical processes, and the width of rooted labeled trees. Electron. J. Combin., 8(1): Research Paper 14, 19 pp., 2001.
34. P. Chassaing, J. F. Marckert, and M. Yor. The height and width of simple trees. In Mathematics and computer science (Versailles, 2000), Trends Math., pages 17-30. Birkhäuser, Basel, 2000.
35. P. Chassaing and G. Schaeffer. Random planar lattices and integrated super-Brownian excursion. Probab. Theory Relat. Fields, 128(2):161-212, 2004.
36. B. Chauvin and M. Drmota. The random multisection problem, travelling waves and the distribution of the height of m-ary search trees. Algorithmica, 46(3-4):299-327, 2006.
37. B. Chauvin, M. Drmota, and J. Jabbour-Hattab. The profile of binary search trees. Ann. Appl. Probab., 11(4):1042-1062, 2001.
38. B. Chauvin, T. Klein, J.-F. Marckert, and A. Rouault. Martingales and profile of binary search trees. Electron. J. Probab., 10: no. 12, 420-435, 2005.
39. B. Chauvin and A. Rouault. Connecting yule process, bisection and binary search trees via martingales. J. Iranian Statist. Soc., 3(2):89-116, 2004.
40. F. Chyzak, M. Drmota, T. Klausner, and G. Kok. The distribution of patterns in random trees. Combin. Probab. Comput., 17:21-59, 2008.
41. J. Clément, P. Flajolet, and B. Vallée. Dynamical sources in information theory: A general analysis of trie structures. Algorithmica, 29(1-2):307-369, 2001.
42. J. W. Cohen and G. Hooghiemstra. Brownian excursion, the M/M/1 queue and their occupation times. Math. Oper. Res., 6(4):608-629, 1981.
43. G. Dall'Aglio. Sugli estremi dei momenti delle funzioni di ripartizione doppia. Ann. Scuoloa Norm. Sup. Pisa (3), 10:35-74, 1956.
44. R. De La Briandais. File searching using variable length keys. In Proceedi ngs of the AFIPS Spring Joint Computer Conference, pages 295-298. AFIPS Press, Reston, Va., 1959.
45. C. Dellacherie and P.-A. Meyer. Probabilités et potentiel. Hermann, Paris, 1975.
46. J.-F. Delmas. Computation of moments for the length of the one dimensional ISE support. Electron. J. Probab., 8(Paper No. 17):15 p., 2003.
47. A. Denise, M. Vasconcellos, and D. J. A. Welsh. The random planar graph. Congr. Numer., 113:61-79, 1996.
48. L. Devroye. A probabilistic analysis of the height of tries and of the complexity of triesort. Acta Inform., 21(3):229-237, 1984.
49. L. Devroye. A note on the height of binary search trees. J. Assoc. Comput. Mach., 33(3):489-498, 1986.
50. L. Devroye. A study of trie-like structures under the density model. Ann. Appl. Probab., 2(2):402-434, 1992.
51. L. Devroye. Universal asymptotics for random tries and PATRICIA trees. Algorithmica, 42(1):11-29, 2005.
52. L. Devroye and S. Janson. Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. manuscript.
53. L. Devroye and J. Lu. The strong convergence of maximal degrees in uniform random recursive trees and dags. Random Structures Algorithms, 7(1):1-14, 1995.
54. R. P. Dobrow and R. T. Smythe. Poisson approximations for functionals or random trees. Random Structures Algorithms, 9(1-2):79-92, 1996.
55. A. A. Dobrynin, R. Entringer, and I. Gutman. Wiener index of trees: theory and applications. Acta Appl. Math., 66(3):211-249, 2001.
56. M. Dondajewski and J. Szymański. On the distribution of vertex-degrees in a strata of a random recursive tree. Bull. Acad. Polon. Sci. Sér. Sci. Math., 30(5-6):205-209, 1982.
57. M. Drmota. The height of increasing trees. Ann. Combinat. to appear.
58. M. Drmota. Distribution of the height of leaves of rooted trees. Diskret. Mat., 6(1):67-82, 1994.
59. M. Drmota. Systems of functional equations. Random Structures Algorithms, 10(1-2):103-124, 1997.
60. M. Drmota. The saturation level in binary search tree. In Mathematics and computer science (Versailles, 2000), Trends Math., pages 41-51. Birkhäuser, Basel, 2000.
61. M. Drmota. The variance of the height of binary search trees. Theoret. Comput. Sci., 270(1-2):913-919, 2002.
62. M. Drmota. An analytic approach to the height of binary search trees. II. J. ACM, 50(3):333-374, 2003.
63. M. Drmota, O. Giménez, and M. Noy. Degree distribution in random planar graph. manuscript.
64. M. Drmota, O. Giménez, and M. Noy. Vertices of given degree in series-paralles graphs. Random Structures Algorithms, 2009. to appear.
65. M. Drmota and B. Gittenberger. The shape of unlabeled rooted random trees. manuscript.
66. M. Drmota and B. Gittenberger. On the profile of random trees. Random Structures Algorithms, 10(4):421-451, 1997.
67. M. Drmota and B. Gittenberger. The width of Galton-Watson trees conditioned by the size. Discrete Math. Theor. Comput. Sci., 6(2):387-400, 2004.
68. M. Drmota, S. Janson, and R. Neininger. A functional limit theorem for the profile of search trees. Ann. Appl. Probab., 18(1):288-333, 2008.
69. M. Drmota and J.-F. Marckert. Reinforced weak convergence of stochastic processes. Statist. Probab. Lett., 71(3):283-294, 2005.
70. M. Drmota and W. Szpankowsi. (Un) expected behavior of digital search tree profile. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09).
71. R. M. Dudley. Real analysis and probability. Wadsworth & Brooks/Cole Advanced Books & Software, Pacific Grove, CA, 1989.
72. T. Duquesne. A limit theorem for the contour process of conditioned Galton-Watson trees. Ann. Probab., 31(2):996-1027, 2003.
73. T. Duquesne and J.-F. Le Gall. Random trees, Lévy processes and spatial branching processes. Astérisque, (281): vi+ 147 pages, 2002.
74. T. Duquesne and J.-F. Le Gall. Probabilistic and fractal aspects of Lévy trees. Probab. Theory Related Fields, 131(4):553-603, 2005.
75. S. N. Evans. Probability and real trees, volume 1920 of Lecture Notes in Mathematics. Springer, Berlin, 2008.
76. S. N. Evans, J. Pitman, and A. Winter. Rayleigh processes, real trees, and root growth with re-grafting. Probab. Theory Related Fields, 134(1):81-126, 2006.
77. J. A. Fill and S. Janson. Smoothness and decay properties of the limiting Quicksort density function. In Mathematics and Computer Science (Versailles, 2000), Trends Math., pages 53-64. Birkhäuser, Basel, 2000.
78. J. A. Fill and S. Janson. Approximating the limiting Quicksort distribution. Random Structures Algorithms, 19(3-4):376-406, 2001.
79. J. A. Fill and S. Janson. Quicksort asymptotics. J. Algorithms, 44(1):4-28, 2002.
80. P. Flajolet, Z. Gao, A. Odlyzko, and B. Richmond. The distribution of heights of binary trees and other simple trees. Combin. Probab. Comput., 2(2):145-156, 1993.
81. P. Flajolet, X. Gourdon, and P. Dumas. Mellin transforms and asymptotics: harmonic sums. Theoret. Comput. Sci., 144(1-2):3-58, 1995.
82. P. Flajolet and A. Odlyzko. The average height of binary trees and other simple trees. J. Comput. System Sci., 25(2):171-213, 1982.
83. P. Flajolet and A. Odlyzko. Singularity analysis of generating functions. SIAM J. Discrete Math., 3(2):216-240, 1990.
84. P. Flajolet and R. Sedgewick. Analytic Combinatorics. Cambridge University Press, Cambridge, 2008.
85. P. Flajolet and J.-M Steyaert. A branching process arising in dynamic hashing, trie searching and polynomial factorization. In Automata, languages and programming (Aarhus, 1982), volume 140 of Lecture Notes in Comput. Sci., pages 239-251. Springer, Berlin, 1982.
86. E. Fredkin. Trie memory. Communications of the ACM, 3:490-499, 1960.
87. M. Fuchs, H.-K. Hwang, and R. Neininger. Profiles of random trees: limit theorems for random recursive trees and binary search trees. Algorithmica, 46(3-4):367-407, 2006.
88. J. Gastwirth and P. Bhattacharya. Two probability models of pyramids or chain letter schemes demo strating that their promotional claims are unreliable. Operations Research, 32:527-536, 1984.
89. S. Gerke and C. McDiarmid. On the number of edges in random planar graphs. Combin. Probab. Comput., 13(2):165-183, 2004.
90. R. K. Getoor and M. J. Sharpe. Excursions of Brownian motion and Bessel processes. Z. Wahrsch. Verw. Gebiete, 47(1):83-106, 1979.
91. O. Giménez and M. Noy. Asymptotic enumeration and limit laws of planar graphs. J. Amer. Math. Soc. to appear, arXiv:math/0501269.
92. B. Gittenberger. On the contour of random trees. SIAM J. Discrete Math., 12(4):434-458, 1999.
93. B. Gittenberger and G. Louchard. The Brownian excursion multi-dimensional local time density. J. Appl. Probab., 36(2):350-373, 1999.
94. W. Goh and E. Schmutz. Limit distribution for the maximum degree of a random recursive tree. J. Comput. Appl. Math., 142(1):61-82, 2002.
95. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete mathematics. Addison-Wesley, Reading, MA, 1989.
96. D. H. Greene and D. E. Knuth. Mathematics for the analysis of algorithms. Birkhäuser Boston Inc., Boston, MA, third edition, 1990.
97. I. Gutman and O. E. Polanski. Mathematical Concepts in Organic Chemistry. Springer, Berlin, 1986.
98. F. Harary and E. M. Palmer. Graphical enumeration. Academic Press, New York, 1973.
99. W. K. Hayman. A generalisation of Stirling's formula. J. Reine Angew. Math., 196:67-95, 1956.
100. C. A. R. Hoare. Algorithm 64: Quicksort. Communic. Assoc. Comput. Masch., 4:321, 1961.
101. C. A. R. Hoare. Quicksort. Computer Journal, 5:10-15, 1962.
102. M. Hofri. Analysis of algorithms. The Clarendon Press Oxford University Press, New York, 1995.
103. G. Hooghiemstra. On the explicit form of the density of Brownian excursion local time. Proc. Amer. Math. Soc., 84(1):127-130, 1982.
104. H.-K. Hwang. Théoremes limites pour les structures combinatoires et les fonctions arithmetiques. PhD Thesis, Ecole Polytechnique, New York, 1994.
105. H.-K. Hwang. Large deviations for combinatorial distributions. I. central limit theorems. Ann. Appl. Probab., 6:297-319, 1996.
106. H.-K. Hwang. Profiles of random trees: plane-oriented recursive trees. Random Structures Algorithms, 30(3):380-413, 2007.
107. H.-K. Hwang and R. Neininger. Phase change of limit laws in the quicksort recurrence under varying toll functions. SIAM J. Comput, 31(6):1687-1722, 2002.
108. J. Jabbour-Hattab. Martingales and large deviations for binary search trees. Random Structures Algorithms, 19(2):112-127, 2001.
109. B. Jacquard and G. Schaeffer. A bijective census of nonseparable planar maps. J. Combin. Theory Ser. A, 83(1):1-20, 1998.
110. P. Jacquet and M. Regnier. Trie partitioning process: limiting distributions. In CAAP'86 (Nice, 1986), volume 214 of Lecture Notes in Comput. Sci., pages 196-210. Springer, Berlin, 1986.
111. P. Jacquet and W. Szpankowski. Analysis of digital tries with Markovian dependency. IEEE Trans. Information Theory, 37:1470-1475, 1991.
112. P. Jacquet and W. Szpankowski. Asymptotic behavior of the Lempel-Ziv parsing scheme and [in] digital search trees. Theoret. Comput. Sci., 144(1-2):161-197, 1995.
113. P. Jacquet and W. Szpankowski. Analytical de-Poissonization and its applications. Theoret. Comput. Sci., 201(1-2):1-62, 1998.
114. S. Janson. Random cutting and records in deterministic and random trees. Random Structures Algorithms, 29(2):139-179, 2006.
115. S. Janson, D. E. Knuth, T. Luczak, and B. Pittel. The birth of the giant component. Random Structures Algorithms, 4(3):231-358, 1993.
116. S. Janson, T. Luczak, and A. Ruciński. Random graphs. Wiley-Interscience, New York, 2000.
117. S. Janson and J.-F. Marckert. Convergence of discrete snakes. J. Theor. Probab., 18(3):615-645, 2005.
118. A. Joffe, L. Le Cam, and J. Neveu. Sur la loi des grands nombres pour des variables aleatoires de Bernoulli attachees a un arbre dyadique. C. R. Acad. Sci. Paris Ser. A-B, 277:A963-A964, 1973.
119. O. Kallenberg. Foundations of modern probability. Springer-Verlag, New York, second edition, 2002.
120. I. Karatzas and S. E. Shreve. Brownian motion and stochastic calculus. Springer-Verlag, New York, 1988.
121. L. Kaup and B. Kaup. Holomorphic functions of several variables. Walter de Gruyter & Co., Berlin, 1983.
122. R. Kemp. Fundamentals of the average case analysis of particular algorithms. John Wiley & Sons Ltd., Chichester, 1984.
123. D. P. Kennedy. The distribution of the maximum Brownian excursion. J. Appl. Probab., 13:371-376, 1976.
124. G. Kersting. On the height profile of a conditioned Galton-Watson tree. manuscript, 1998.
125. C. Knessl and W. Szpankowski. Quicksort algorithm again revisited. Discrete Math. Theor. Comput. Sci., 3(2):43-64, 1999.
126. C. Knessl and W. Szpankowski. On the average profile of symmetric digital search trees. manuscript, 2008.
127. F. B. Knight. On the excursion process of Brownian motion. Trans. Am. Math. Soc, 258:77-86, 1980.
128. D. E. Knuth. The art of computer programming. Vol. 1. Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, second edition, 1975.
129. D. E. Knuth. The art of computer programming. Vol. 2. Addison-Wesley Publishing Co., Reading, Mass., second edition, 1981.
130. D. E. Knuth. The art of computer programming. Vol. 3. Addison-Wesley Publishing Co., Reading, Mass., second edition, 1998.
131. V. F. Kolchin. Branching processes, random trees, and a generalized scheme of arrangements of particles. Math. Notes, 21:386-394, 1977.
132. V. F. Kolchin. Random mappings. Optimization Software Inc. Publications Division, New York, 1986.
133. V. F. Kolchin. Random graphs. Cambridge University Press, Cambridge, 1999.
134. M. Kuba and A. Panholzer. On the degree distribution of the nodes in increasing trees. J. Combin. Theory Ser. A, 114:597-618, 2007.
135. J.-F. Le Gall. Random trees and applications. Probab. Surv., 2:245-311, 2005.
136. J.-F. Le Gall. Random real trees. Ann. Fac. Sci. Toulouse Série 6, 15:35-62, 2006.
137. V. A. Liskovets. A pattern of asymptotic vertex valency distributions in planar maps. J. Combin. Theory Ser. B, 75(1):116-133, 1999.
138. C. L. Liu. Introduction to combinatorial mathematics. McGraw-Hill Book Co., New York, 1968.
139. M. Loève. Probability theory. I. Springer-Verlag, New York, fourth edition, 1977.
140. G. Louchard. The Brownian excursion area: a numerical analysis. Comput. Math. Appl., 10(6):413-417(1985), 1984.
141. G. Louchard. Kacs formula, Levys local time and Brownian excursion. J. Appl. Probab., 21(3):479-499, 1984.
142. G. Louchard. Exact and asymptotic distributions in digital and binary search trees. RAIRO Inform. Théor. Appl., 21(4):479-495, 1987.
143. G. Louchard and W. Szpankowski. Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm. IEEE Trans. Inf. Th., 41:478-488, 1995.
144. G. Louchard and W. Szpankowski. A probabilistic analysis of a string editing problem and its variations. Combin. Probab. Comput., 4(2):143-166, 1995.
145. W. C. Lynch. More combinatorial properties of certain trees. The Computer Journal, 7(4):299-302, 1965.
146. H. M. Mahmoud. Evolution of random search trees. John Wiley & Sons Inc., New York, 1992.
147. H. M. Mahmoud. Pólya urn modles. Text in Statistical Science. Boca Raton, FL: CRC Press., 2009.
148. P. Major. On the invariance principle for sums of independent identically distributed random variables. J. Multivariate Anal., 8(4):487-517, 1978.
149. C. McDiarmid and B. Reed. On the maximum degree of a random planar graph. Combin. Probab. Comput., 17(4):591-601, 2008.
150. C. McDiarmid, A. Steger, and D. J. A. Welsh. Random planar graphs. J. Combin. Theory Ser. B, 93:187-205, 2005.
151. A. Meir and J. W. Moon. On the altitude of nodes in random trees. Canad. J. Math., 30(5):997-1015, 1978.
152. A. Meir and J. W. Moon. On an asymptotic method in enumeration. J. Combin. Theory Ser. A, 51(1):77-89, 1989.
153. A. Meir and J. W. Moon. On nodes of large out-degree in random trees. In Proceedings of the Twenty-second Southeastern Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 1991), Congr. Numer., 82:3-13, 1991.
154. H. Minc. Nonnegative matrices. John Wiley & Sons Inc., New York, 1988.
155. J. Moon. The distance between nodes in recursive trees. London Math. Soc. Lecture Notes, Cambridge Univ. Press, London, 13:125-132, 1974.
156. R. C. Mullin and P. J. Schellenberg. The enumeration of c-nets via quadrangulations. J. Combin. Theory, 4:259-276, 1968.
157. D. Najock and C. Heyde. On the number of terminal vertices in certain random trees with an application to stemma construction in Philology. J. Applied Probab., 19:675-680, 1982.
158. R. Neininger. On a multivariate contraction method for random recursive structures with applications to Quicksort. Random Structures Algorithms, 19(3-4):498-524, 2001.
159. R. Neininger. The Wiener index of random trees. Combin. Probab. Comput., 11(6):587-597, 2002.
160. R. Neininger. Stochastische Analyse von Algorithmen, Fixpunktgleichungen und ideale Metriken. Habilitation Thesis, Universität Frankfurt a. M., 2004.
161. R. Neininger and L. Rüschendorf. A general limit theorem for recursive algorithms and combinatorial structures. Ann. Appl. Probab., 14(1):378-418, 2004.
162. R. Neininger and L. Rüschendorf. On the contraction method with degenerate limit equation. Ann. Probab., 32(3B):2838-2856, 2004.
163. R. Neininger and L. Rüschendorf. A survey of multivariate aspects of the contraction method. Discrete Math. Theor. Comput. Sci., 8(1):31-56, 2006.
164. J. Neveu. Martingales à temps discret. Masson et Cie, éediteurs, Paris, 1972.
165. A. M. Odlyzko. Asymptotic enumeration methods. In Handbook of combinatorics, Vol. 1, 2, pages 1063-1229. Elsevier, Amsterdam, 1995.
166. A. M. Odlyzko and H. S. Wilf. Bandwidths and profiles of trees. J. Combin. Theory Ser. B, 42(3):348-370, 1987.
167. D. Osthus, H. J. Prömel, and A. Taraz. On random planar graphs, the number of planar graphs and their triangulations,. J. Combin. Theory Ser. B, 88:119-134, 2003.
168. R. Otter. The number of trees. Ann. of Math. (2), 49:583-599, 1948.
169. G. Park, H.-K. Hwang, P. Nicodème, and W. Szpankowski. Profiles of tries. SIAM J. Computing, page to appear.
170. J. Pitman. The SDE solved by local times of a brownian excursion or bridge derived from the height profile of a random tree or forest. Ann. Probab., 27:261-283, 1999.
171. J. Pitman. Combinatorial stochastic processes, volume 1875 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 2006.
172. B. Pittel. On growing random binary trees. J. Math. Anal. Appl., 103(2):461-480, 1984.
173. B. Pittel. Asymptotical growth of a class of random trees. Ann. Probab., 13(2):414-427, 1985.
174. B. Pittel. Paths in a random digital tree: limiting distributions. Adv. in Appl. Probab., 18(1):139-155, 1986.
175. B. Pittel. Note on the heights of random recursive trees and random m-ary search trees. Random Structures Algorithms, 5(2):337-347, 1994.
176. G. Polya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math., 68:145-254, 1937.
177. H. Prodinger. Digital search trees and basic hypergeometric functions. Bulletin of the EATCS, 56, 1995.
178. S. T. Rachev. Probability metrics and the stability of stochastic models. John Wiley & Sons Ltd., Chichester, 1991.
179. S. T. Rachev and L. Rüschendorf. Probability metrics and recursive algorithms. Adv. in Appl. Probab., 27(3):770-799, 1995.
180. S. T. Rachev and L. Rüschendorf. Mass transportation problems. Vol. 1. Springer-Verlag, New York, 1998.
181. B. Reed. The height of a random binary search tree. J. Assoc. Comput. Mach., 50(3):306-332, 2003.
182. M. Régnier. A limiting distribution for quicksort. RAIRO Inform. Théor. Appl., 23(3):335-343, 1989.
183. D. Revuz and M. Yor. Continuous martingales and Brownian motion. Springer-Verlag, Berlin, third edition, 1999.
184. R. J. Riddell. Contribution to the theory of condensation. PhD Thesis, Univ. Michigan, Ann Arbor, 1951.
185. J. M. Robson. On the concentration of the height of binary search trees. ICALP 97 Proceedings, LNCS 1256, pages 441-448, 1997.
186. U. Rösler. A limit theorem for "Quicksort". RAIRO Inform. Théor. Appl., 25(1):85-100, 1991.
187. U. Rösler. On the analysis of stochastic divide and conquer algorithms. Algorithmica, 29(1-2):238-261, 2001.
188. G. Schaeffer. Conjugaison darbres et cartes combinatoires aléatoires. PhD Thesis, Université Bordeaux I, 1998.
189. E.-M. Schopp. Tail Behaviour and Martingale Convergence of Random Recursive Structures and Algorithms. PhD Thesis, Univ. Freiburg (Germany), 2008.
190. R. Sedgewick. Quicksort. Gurland Publishing, New York, 1980.
191. R. Sedgewick and P. Flajolet. An Introduction to the Analysis of Algorithms. Addison Wesley, Reading, MA, 1996.
192. R. T. Smythe and H. M. Mahmoud. A survey of recursive trees. Theory Probab. Math. Stat., 51:1-27, 1994.
193. V. E. Stepanov. The distribution of the number of vertices in the layers of a random tree. Teor. Verojatnost. i Primenen., 14:64-77, 1969.
194. H. Sulzbach. A functional limit law for the profile of plane-oriented recursive trees. In Fifth Colloquium on Mathematics and Computer Science (2008), Discrete Math. Theor. Comput. Sci. Proc., AC.
195. W. Szpankowski. A characterization of digital search trees from the successful search viewpoint. Theoret. Comput. Sci., 85(1):117-134, 1991.
196. W. Szpankowski. On the height of digital trees and related problems. Algorithmica, 6(2):256-277, 1991.
197. W. Szpankowski. Average case analysis of algorithms on sequences. Wiley-Interscience, New York, 2001.
198. J. Szymański. On the maximum degree and the height of a random recursive tree. In Random graphs'87 (Poznań, 1987), pages 313-324. Wiley, Chichester, 1990.
199. L. Takács. Conditional limit theorems for branching processes. J. Appl. Math. Stochastic Anal., 4(4):263-292, 1991.
200. L. Takács. The asymptotic distribution of the total heights of random rooted trees. Acta Sci. Math., 57:613-625, 1993.
201. K. H. Tan and P. Hadjicostas. Some properties of a limiting distribution of Quicksort. Statistics Probab. Letter, 25:87-94, 1995.
202. B. A. Trakhtenbrot. Towards a theory of non-repeating contract schemes. Trudi Mat. Inst. Akad. Nauk SSSR, 51:226-269, 1958.
203. W. T. Tutte. A census of planar triangulations. Canad. J. Math., 14:21-38, 1962.
204. W. T. Tutte. A census of planar maps. Canad. J. Math., 15:249-271, 1963.
205. W. T. Tutte. On the enumeration of planar maps. Bull. Amer. Math. Soc., 74:64-74, 1968.
206. B. Vallée. Dynamical sources in information theory: fundamental intervals and word prefixes. Algorithmica, 29(1-2):262-306, 2001.
207. T. R. S. Walsh. Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory Ser. B, 32(1):12-32, 1982.
208. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory, 24(5):530-536, 1978.
209. V. M. Zolotarev. Approximation of the distributions of sums of independent random variables with values in infinite-dimensional spaces. Teor. Verojatnost. i Primenen., 21(4):741-758, 1976.