Bibliographie
501
151. N. Johnson, S. Kotz, Urn Models and Their Application (Wiley, New York, 1977)
152. D. Kennedy, The distribution of the maximum Brownian excursion. J. Appl. Probab. 13,
371–376 (1976)
153. H. Kesten, Subdiffusive behavior of random walk on a random cluster. Ann. Inst. Henri
Poincaré 22(4), 425–487 (1986)
154. L. Khizder, Some combinatorial properties of dyadic trees. USSR Comput. Math. Math.
Phys. (traduction anglaise de Zh. Vychisl. Matem. i Matem. Fiziki) 6(2), 283–290 (1966)
155. M. Knape, R. Neininger, Pólya urns via the contraction method. Preprint (2013)
156. D. Knuth, The Art of Computer Programming, Vol. 3 : Sorting and Searching, 2nd edn.
(Addison-Wesley, Redwood City, 1998)
157. D.E. Knuth, The Art of Computer Programming, Vol 1 : Fundamental Algorithms, 2nd edn.
(Addison-Wesley, Redwood City, 1973)
158. D. Knuth, A. Schonhage, The expected linearity of a simple equivalence algorithm. Theor.
Comput. Sci. 6, 281–315 (1978)
159. V. Kolchin, Branching processes, random trees, and a generalized scheme of arrangements of
particles. Math. Notes 21, 386–394 (1977)
160. V. Kolchin, Random Mappings (Optimization Software Inc. Publications Division, New York,
1986)
161. S. Kotz, H. Mahmoud, P. Robert, On generalized Pólya urn models. Stat. Probab. Lett. 49,
163–173 (2000)
162. R. Kruse, A. Ryba, Data Structures and Program Design in C++ (Prentice Hall, Upper
Saddle River, 2000)
163. P.-Å. Larson, Dynamic hashing. BIT Numer. Math. 18(2), 184–201 (1978)
164. H. Lefmann, P. Savický. Some typical properties of large AND/OR boolean formulas. Random
Struct. Algoritm. 10(3), 337–351 (1997)
165. W. Litwin, Virtual hashing: a dynamically changing hashing, in Fourth International
Conference on Very Large Data Bases, 13–15 September 1978, West Berlin, ed. by S.B. Yao
(IEEE Computer Society, Washington, 1978), pp. 517–523
166. G. Louchard, Trie size in a dynamic list structure. Random Struct. Algoritm. 5(5), 665–702
(1994)
167. G. Louchard, The asymmetric leader election algorithm: number of survivors near the end of
the game. Quaest. Math. (2015)
168. G. Louchard, H. Prodinger, M. Ward, Number of survivors in the presence of a demon. Period.
Math. Hung. 64(1), 101–117 (2012)
169. W.C. Lynch, More combinatorial properties of certain trees. Comput. J. 7(4), 299–302
(1965)
170. R. Lyons, A simple path to Biggins’ martingale convergence for branching random walk, in
Classical and Modern Branching Processes, ed. by K.B. Athreya, P. Jagers. IMA Volumes in
Mathematics and Its Applications, vol. 84 (Springer, New York, 1997)
171. R. Lyons, R. Pemantle, Y. Peres, Conceptual proofs of l log l criteria for mean behavior of
branching processes. Ann. Probab. 23, 1125–1138 (1995)
172. H. Mahmoud, Evolution of Random Search Trees (Wiley, New York, 1992)
173. H. Mahmoud, Pólya urn Models (CRC Press, Boca Raton, 2008)
174. H. Mahmoud, B. Pittel, On the most probable shape of a search tree grown from a random
permutation. SIAM J. Algebraic Discrete Methods 5(1), 69–81 (1984)
175. H. Mahmoud, B. Pittel, Analysis of the space of search trees under the random insertion
algorithm. J. Algorithm. 10, 52–75 (1989)
176. H. Mahmoud, R.T. Smythe, Probabilistic analysis of bucket recursive trees. Theor. Comput.
Sci. 144, 221–249 (1995)
177. P. Major, On the invariance principle for sums of independent identically distributed random
variables. J. Multivar. Anal. 8, 487–517 (1978)
178. J.-F. Marckert, Limit of random walks and of random trees (2009). Cours. http://www.labri.
fr/perso/marckert/GRAZ.pdf
179. C. Martínez, S. Roura, Randomized binary search trees. J. ACM 45(2), 288–323 (1998)
501
151. N. Johnson, S. Kotz, Urn Models and Their Application (Wiley, New York, 1977)
152. D. Kennedy, The distribution of the maximum Brownian excursion. J. Appl. Probab. 13,
371–376 (1976)
153. H. Kesten, Subdiffusive behavior of random walk on a random cluster. Ann. Inst. Henri
Poincaré 22(4), 425–487 (1986)
154. L. Khizder, Some combinatorial properties of dyadic trees. USSR Comput. Math. Math.
Phys. (traduction anglaise de Zh. Vychisl. Matem. i Matem. Fiziki) 6(2), 283–290 (1966)
155. M. Knape, R. Neininger, Pólya urns via the contraction method. Preprint (2013)
156. D. Knuth, The Art of Computer Programming, Vol. 3 : Sorting and Searching, 2nd edn.
(Addison-Wesley, Redwood City, 1998)
157. D.E. Knuth, The Art of Computer Programming, Vol 1 : Fundamental Algorithms, 2nd edn.
(Addison-Wesley, Redwood City, 1973)
158. D. Knuth, A. Schonhage, The expected linearity of a simple equivalence algorithm. Theor.
Comput. Sci. 6, 281–315 (1978)
159. V. Kolchin, Branching processes, random trees, and a generalized scheme of arrangements of
particles. Math. Notes 21, 386–394 (1977)
160. V. Kolchin, Random Mappings (Optimization Software Inc. Publications Division, New York,
1986)
161. S. Kotz, H. Mahmoud, P. Robert, On generalized Pólya urn models. Stat. Probab. Lett. 49,
163–173 (2000)
162. R. Kruse, A. Ryba, Data Structures and Program Design in C++ (Prentice Hall, Upper
Saddle River, 2000)
163. P.-Å. Larson, Dynamic hashing. BIT Numer. Math. 18(2), 184–201 (1978)
164. H. Lefmann, P. Savický. Some typical properties of large AND/OR boolean formulas. Random
Struct. Algoritm. 10(3), 337–351 (1997)
165. W. Litwin, Virtual hashing: a dynamically changing hashing, in Fourth International
Conference on Very Large Data Bases, 13–15 September 1978, West Berlin, ed. by S.B. Yao
(IEEE Computer Society, Washington, 1978), pp. 517–523
166. G. Louchard, Trie size in a dynamic list structure. Random Struct. Algoritm. 5(5), 665–702
(1994)
167. G. Louchard, The asymmetric leader election algorithm: number of survivors near the end of
the game. Quaest. Math. (2015)
168. G. Louchard, H. Prodinger, M. Ward, Number of survivors in the presence of a demon. Period.
Math. Hung. 64(1), 101–117 (2012)
169. W.C. Lynch, More combinatorial properties of certain trees. Comput. J. 7(4), 299–302
(1965)
170. R. Lyons, A simple path to Biggins’ martingale convergence for branching random walk, in
Classical and Modern Branching Processes, ed. by K.B. Athreya, P. Jagers. IMA Volumes in
Mathematics and Its Applications, vol. 84 (Springer, New York, 1997)
171. R. Lyons, R. Pemantle, Y. Peres, Conceptual proofs of l log l criteria for mean behavior of
branching processes. Ann. Probab. 23, 1125–1138 (1995)
172. H. Mahmoud, Evolution of Random Search Trees (Wiley, New York, 1992)
173. H. Mahmoud, Pólya urn Models (CRC Press, Boca Raton, 2008)
174. H. Mahmoud, B. Pittel, On the most probable shape of a search tree grown from a random
permutation. SIAM J. Algebraic Discrete Methods 5(1), 69–81 (1984)
175. H. Mahmoud, B. Pittel, Analysis of the space of search trees under the random insertion
algorithm. J. Algorithm. 10, 52–75 (1989)
176. H. Mahmoud, R.T. Smythe, Probabilistic analysis of bucket recursive trees. Theor. Comput.
Sci. 144, 221–249 (1995)
177. P. Major, On the invariance principle for sums of independent identically distributed random
variables. J. Multivar. Anal. 8, 487–517 (1978)
178. J.-F. Marckert, Limit of random walks and of random trees (2009). Cours. http://www.labri.
fr/perso/marckert/GRAZ.pdf
179. C. Martínez, S. Roura, Randomized binary search trees. J. ACM 45(2), 288–323 (1998)