Bibliographie
503
209. B. Pittel, Note on the heights of random recursive trees and random m-ary search trees.
Random Struct. Algoritm. 5(2), 337–347 (1994)
210. G. Pólya, Sur quelques points de la théorie des probabilités. Ann. Inst. Henri Poincaré 1,
117–161 (1931)
211. G. Pólya, R. Read, Combinatorial enumeration of Groups, Graphs and Chemical Compounds
(Springer, New York, 1987)
212. T. Porter, I. Simon, Random insertion into a priority queue structure. IEEE Trans. Softw.
Eng. SE-1(3), 292–298 (1975)
213. N. Pouyanne, Classification of large Pólya-Eggenberger urns with regard to their asymptotics,
in Discrete Mathematics and Theoretical Computer Science, AD (2005), pp. 275–286
214. N. Pouyanne, An algebraic approach to Pólya processes. Ann. Inst. Henri Poincaré 44(2),
293–323 (2008)
215. N. Pouyanne, Urnes de Pólya. Mini-cours de Mahdia, ADAMA (2012). http://pouyanne.
perso.math.cnrs.fr/mahdia2012.pdf
216. N. Pouyanne, Transfert, col, inversion de Lagrange : ouvrir les boîtes noires (2014). http://
pouyanne.perso.math.cnrs.fr/alea2014Pouyanne.pdf
217. H. Prodinger, How to select a loser. Discret. Math. 20, 149–159 (1993)
218. B. Reed, The height of a random binary search tree. J. ACM 50(3), 306–332 (2003)
219. M. Régnier, A limiting distribution for quicksort. RAIRO Theor. Inf. Appl. 23, 335–343
(1989)
220. E. Reingold, A note on 3–2 trees. Fibonacci Q. 151–157 (1979)
221. D. Revuz, M. Yor, Continuous Martingales and Brownian Motion, 3rd edn. (Springer, Berlin,
1999)
222. R.F. Rice, Some practical universal noiseless coding techniques. Technical Report JPL-79–
22, JPL, Pasadena (1979). http://tinyurl.com/R.F.Rice-coding-techniques
223. M. Roberts, Almost sure asymptotics for the random binary search tree, in DMTCS
Proceedings, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic
Methods in the Analysis of Algorithms (AofA’10) (2010)
224. U. Rösler, A limit theorem for quicksort. Theor. Inf. Appl. 25(1), 85–100 (1991)
225. U. Rösler, L. Rüschendorf, The contraction method for recursive algorithms. Algorithmica
29(1–2), 3–33 (2001)
226. M. Roux, B. Vallée, Information theory: sources, Dirichlet series, and realistic analyses of
data structures, in Proceedings 8th International Conference Words 2011. EPTCS, vol. 63
(2011), pp. 199–214
227. D. Salomon, Data Compression: The Complete Reference (Springer, Berlin, 2007). With
contributions by G. Motta and D. Bryant
228. P. Savický, Complexity and probability of some Boolean formulas. Comb. Probab. Comput.
7, 451–463 (1998)
229. P. Savický, A. Woods, The number of Boolean functions computed by formulas of a given
size. Random Struct. Algoritm. 13, 349–382 (1998)
230. G. Schaeffer, Bijective census and random generation of eulerian planar maps with prescribed
degrees. Electron. J. Comb. 4(1) (1997)
231. R. Sedgewick, Algorithms in C: Fundamentals, Data Structures, Sorting, Searching, 3rd edn.
(Addison–Wesley, Reading, 1988)
232. R. Sedgewick, P. Flajolet, Introduction to the Analysis of Algorithms (Addison-Wesley,
Reading, 1996)
233. R. Sedgewick, K. Wayne, Algorithms, 4th edn. (Addison-Wesley, Reading, 2011)
234. R. Seidel, M. Sharir, Top-down analysis of path compression. SIAM J. Comput. 34(3), 515–
525 (2005)
235. B.W. Silverman, Density Estimation for Statistics and Data Analysis (Chapman and Hall,
London, 1986)
236. R.T. Smythe, Central limit theorems for urn models. Stoch. Process. Appl. 65, 115–137
(1996)
503
209. B. Pittel, Note on the heights of random recursive trees and random m-ary search trees.
Random Struct. Algoritm. 5(2), 337–347 (1994)
210. G. Pólya, Sur quelques points de la théorie des probabilités. Ann. Inst. Henri Poincaré 1,
117–161 (1931)
211. G. Pólya, R. Read, Combinatorial enumeration of Groups, Graphs and Chemical Compounds
(Springer, New York, 1987)
212. T. Porter, I. Simon, Random insertion into a priority queue structure. IEEE Trans. Softw.
Eng. SE-1(3), 292–298 (1975)
213. N. Pouyanne, Classification of large Pólya-Eggenberger urns with regard to their asymptotics,
in Discrete Mathematics and Theoretical Computer Science, AD (2005), pp. 275–286
214. N. Pouyanne, An algebraic approach to Pólya processes. Ann. Inst. Henri Poincaré 44(2),
293–323 (2008)
215. N. Pouyanne, Urnes de Pólya. Mini-cours de Mahdia, ADAMA (2012). http://pouyanne.
perso.math.cnrs.fr/mahdia2012.pdf
216. N. Pouyanne, Transfert, col, inversion de Lagrange : ouvrir les boîtes noires (2014). http://
pouyanne.perso.math.cnrs.fr/alea2014Pouyanne.pdf
217. H. Prodinger, How to select a loser. Discret. Math. 20, 149–159 (1993)
218. B. Reed, The height of a random binary search tree. J. ACM 50(3), 306–332 (2003)
219. M. Régnier, A limiting distribution for quicksort. RAIRO Theor. Inf. Appl. 23, 335–343
(1989)
220. E. Reingold, A note on 3–2 trees. Fibonacci Q. 151–157 (1979)
221. D. Revuz, M. Yor, Continuous Martingales and Brownian Motion, 3rd edn. (Springer, Berlin,
1999)
222. R.F. Rice, Some practical universal noiseless coding techniques. Technical Report JPL-79–
22, JPL, Pasadena (1979). http://tinyurl.com/R.F.Rice-coding-techniques
223. M. Roberts, Almost sure asymptotics for the random binary search tree, in DMTCS
Proceedings, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic
Methods in the Analysis of Algorithms (AofA’10) (2010)
224. U. Rösler, A limit theorem for quicksort. Theor. Inf. Appl. 25(1), 85–100 (1991)
225. U. Rösler, L. Rüschendorf, The contraction method for recursive algorithms. Algorithmica
29(1–2), 3–33 (2001)
226. M. Roux, B. Vallée, Information theory: sources, Dirichlet series, and realistic analyses of
data structures, in Proceedings 8th International Conference Words 2011. EPTCS, vol. 63
(2011), pp. 199–214
227. D. Salomon, Data Compression: The Complete Reference (Springer, Berlin, 2007). With
contributions by G. Motta and D. Bryant
228. P. Savický, Complexity and probability of some Boolean formulas. Comb. Probab. Comput.
7, 451–463 (1998)
229. P. Savický, A. Woods, The number of Boolean functions computed by formulas of a given
size. Random Struct. Algoritm. 13, 349–382 (1998)
230. G. Schaeffer, Bijective census and random generation of eulerian planar maps with prescribed
degrees. Electron. J. Comb. 4(1) (1997)
231. R. Sedgewick, Algorithms in C: Fundamentals, Data Structures, Sorting, Searching, 3rd edn.
(Addison–Wesley, Reading, 1988)
232. R. Sedgewick, P. Flajolet, Introduction to the Analysis of Algorithms (Addison-Wesley,
Reading, 1996)
233. R. Sedgewick, K. Wayne, Algorithms, 4th edn. (Addison-Wesley, Reading, 2011)
234. R. Seidel, M. Sharir, Top-down analysis of path compression. SIAM J. Comput. 34(3), 515–
525 (2005)
235. B.W. Silverman, Density Estimation for Statistics and Data Analysis (Chapman and Hall,
London, 1986)
236. R.T. Smythe, Central limit theorems for urn models. Stoch. Process. Appl. 65, 115–137
(1996)