502
Bibliographie
180. C. Martínez, S. Roura, Optimal sampling strategies in quicksort and quickselect. SIAM J.
Comput. 31(3), 683–705 (2001)
181. C. Martínez, A. Panholzer, H. Prodinger, On the number of descendants and ascendants in
random search trees. Electron. J. Comb. 5(1), R20 (1998)
182. C. Martínez, D. Panario, A. Viola, Adaptive sampling strategies for quickselects. ACM Trans.
Algorithms 6(3) (2010)
183. C. Martínez, M.E. Nebel, S. Wild, Analysis of branch misses in quicksort, in Proceedings
of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San
Diego, 4 January 2015, pp. 114–128
184. E.M. McCreight, A space-economical suffix tree construction algorithm. J. ACM 23(2),
262–272 (1976)
185. A. Meir, J. Moon, On an asymptotic method in enumeration. J. Comb. Theory (A) 51, 77–89
(1989)
186. H. Mohamed, P. Robert, Dynamic tree algorithm. Ann. Appl. Probab. 20(1), 26–51 (2010)
187. B. Morcrette, Combinatoire analytique et modèles d’urnes. Master’s thesis, Thèse de master
MPRI Paris, 2010
188. B. Morcrette, Combinatoire analytique et modèles d’urnes. PhD thesis, Univ. Paris 6, 2013.
http://tel.archives-ouvertes.fr/tel-00843046
189. R. Morris, Counting large numbers of events in small registers. Commun. ACM 21(10),
840–842 (1978)
190. D.R. Morrison, Patricia-practical algorithm to retrieve information coded in alphanumeric. J.
ACM 15(4), 514–534 (1968)
191. R. Neininger, Probabilistic analysis of algorithms, stochastic fixed-point equations and ideal
metrics (2006). http://dmg.tuwien.ac.at/nfn/neininger/survey.pdf
192. R. Neininger, L. Rüschendorf, A general limit theorem for recursive algorithms and
combinatorial structures. Ann. Appl. Probab. 14, 378–418 (2004)
193. J. Neveu, Martingales à temps discret (Masson, Paris, 1972)
194. J. Neveu, Arbres et processus de Galton-Watson. Ann. Inst. Henri Poincaré 22(2), 199–207
(1986)
195. S. Nilsson, G. Karlsson, Ip-address lookup using lc-tries. IEEE J. Sel. Areas Commun. 17(6),
1083–1092 (1999)
196. N.E. Nörlund. Leçons sur les équations linéaires aux différences finies, in Collection de
monographies sur la théorie des fonctions (Gauthier-Villars, Paris, 1929)
197. N.E. Nörlund. Vorlesungen über Differenzenrechnung (Chelsea Publishing Company,
New York, 1954)
198. J. Norris, Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics
(Cambridge University Press, Cambridge, 1997)
199. A. Odlyzko, Periodic oscillations of coefficients of power series that satisfy functional
equations. Adv. Math. 44(2), 180–205 (1982)
200. On-line encyclopedia of integer sequences. http://oeis.org
201. R. Otter, The number of trees. Ann. Math. 40(3), 583–599 (1948)
202. W. Panny, Deletions in random binary search trees: a story of errors. J. Stat. Plann. Infer.
140(8), 2335–2345 (2010)
203. J.B. Paris, A. Vencovská, G.M. Wilmers, A natural prior probability distribution derived from
the propositional calculus. Ann. Pure Appl. Logic 70, 243–285 (1994)
204. G. Park, H.-K. Hwang, P. Nicodème, W. Szpankowski, Profiles of tries. SIAM J. Comput.
38(5), 1821–1880 (2009)
205. Y. Peres, Probability on trees : an introductory climb. Cours Ecole d’été de Saint-Flour 1997.
Lecture Notes in Mathematics, vol. 1717 (Springer, Berlin, 1999)
206. V.V. Petrov, Limit Theorems of Probability Theory. Sequences of Independent Random
Variables (Oxford Science Publications, Oxford, 1995)
207. B. Pittel, On growing random binary trees. J. Math. Anal. Appl. 103(2), 461–480 (1984)
208. B. Pittel, Paths in a random digital tree: limiting distributions. Adv. Appl. Probab. 18,
139–155 (1986)
Bibliographie
180. C. Martínez, S. Roura, Optimal sampling strategies in quicksort and quickselect. SIAM J.
Comput. 31(3), 683–705 (2001)
181. C. Martínez, A. Panholzer, H. Prodinger, On the number of descendants and ascendants in
random search trees. Electron. J. Comb. 5(1), R20 (1998)
182. C. Martínez, D. Panario, A. Viola, Adaptive sampling strategies for quickselects. ACM Trans.
Algorithms 6(3) (2010)
183. C. Martínez, M.E. Nebel, S. Wild, Analysis of branch misses in quicksort, in Proceedings
of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San
Diego, 4 January 2015, pp. 114–128
184. E.M. McCreight, A space-economical suffix tree construction algorithm. J. ACM 23(2),
262–272 (1976)
185. A. Meir, J. Moon, On an asymptotic method in enumeration. J. Comb. Theory (A) 51, 77–89
(1989)
186. H. Mohamed, P. Robert, Dynamic tree algorithm. Ann. Appl. Probab. 20(1), 26–51 (2010)
187. B. Morcrette, Combinatoire analytique et modèles d’urnes. Master’s thesis, Thèse de master
MPRI Paris, 2010
188. B. Morcrette, Combinatoire analytique et modèles d’urnes. PhD thesis, Univ. Paris 6, 2013.
http://tel.archives-ouvertes.fr/tel-00843046
189. R. Morris, Counting large numbers of events in small registers. Commun. ACM 21(10),
840–842 (1978)
190. D.R. Morrison, Patricia-practical algorithm to retrieve information coded in alphanumeric. J.
ACM 15(4), 514–534 (1968)
191. R. Neininger, Probabilistic analysis of algorithms, stochastic fixed-point equations and ideal
metrics (2006). http://dmg.tuwien.ac.at/nfn/neininger/survey.pdf
192. R. Neininger, L. Rüschendorf, A general limit theorem for recursive algorithms and
combinatorial structures. Ann. Appl. Probab. 14, 378–418 (2004)
193. J. Neveu, Martingales à temps discret (Masson, Paris, 1972)
194. J. Neveu, Arbres et processus de Galton-Watson. Ann. Inst. Henri Poincaré 22(2), 199–207
(1986)
195. S. Nilsson, G. Karlsson, Ip-address lookup using lc-tries. IEEE J. Sel. Areas Commun. 17(6),
1083–1092 (1999)
196. N.E. Nörlund. Leçons sur les équations linéaires aux différences finies, in Collection de
monographies sur la théorie des fonctions (Gauthier-Villars, Paris, 1929)
197. N.E. Nörlund. Vorlesungen über Differenzenrechnung (Chelsea Publishing Company,
New York, 1954)
198. J. Norris, Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics
(Cambridge University Press, Cambridge, 1997)
199. A. Odlyzko, Periodic oscillations of coefficients of power series that satisfy functional
equations. Adv. Math. 44(2), 180–205 (1982)
200. On-line encyclopedia of integer sequences. http://oeis.org
201. R. Otter, The number of trees. Ann. Math. 40(3), 583–599 (1948)
202. W. Panny, Deletions in random binary search trees: a story of errors. J. Stat. Plann. Infer.
140(8), 2335–2345 (2010)
203. J.B. Paris, A. Vencovská, G.M. Wilmers, A natural prior probability distribution derived from
the propositional calculus. Ann. Pure Appl. Logic 70, 243–285 (1994)
204. G. Park, H.-K. Hwang, P. Nicodème, W. Szpankowski, Profiles of tries. SIAM J. Comput.
38(5), 1821–1880 (2009)
205. Y. Peres, Probability on trees : an introductory climb. Cours Ecole d’été de Saint-Flour 1997.
Lecture Notes in Mathematics, vol. 1717 (Springer, Berlin, 1999)
206. V.V. Petrov, Limit Theorems of Probability Theory. Sequences of Independent Random
Variables (Oxford Science Publications, Oxford, 1995)
207. B. Pittel, On growing random binary trees. J. Math. Anal. Appl. 103(2), 461–480 (1984)
208. B. Pittel, Paths in a random digital tree: limiting distributions. Adv. Appl. Probab. 18,
139–155 (1986)