500
Bibliographie
124. G. Grimmett, Random labelled trees and their branching networks. J. Aust. Math. Soc. (Ser.
A) 30, 229–237 (1980)
125. G. Grimmett, D. Stirzaker, Probability and Random Processes (Oxford University Press,
Oxford, 1982). Third edition, 2001
126. D. Gusfield, Algorithm on Strings, Trees, and Sequences: Computer Science and Computational Biology (Cambridge University Press, New York, 1997)
127. R. Hayward, C. McDiarmid. Average-case analysis of heap building by repeated insertion. J.
Algorithm. 12(1), 126–153 (1991)
128. P. Hennequin, Combinatorial analysis of quicksort algorithm. RAIRO Inform. Théor. Appl.
23(3), 317–333 (1989)
129. P. Hennequin, Analyse en moyenne d’algorithmes : Tri rapide et arbres de recherche. PhD
thesis, École Polytechnique, Palaiseau, 1991, 170 pp.
130. E. Hille, Analytic Function Theory, 2 vols (Blaisdell Publishing Company, Waltham, 1962)
131. C. Hoare, Quicksort. Comput. J. 10–15 (1962)
132. M. Hofri, Probabilistic Analysis of Algorithms (Springer, Berlin, 1987)
133. M. Hofri, Analysis of Algorithms. Computational Methods and Mathematical Tools (Oxford
University Press, Oxford, 1995)
134. Y. Hu, Z. Shi, Minimal position and critical martingale convergence in branching random
walks, and directed polymers on disordered trees. Ann. Probab. 37(2), 742–789 (2009)
135. K. Hun, B. Vallée. Typical depth of a digital search tree built on a general source, in
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics,
ANALCO 2014, Portland, 6 January 2014, pp. 1–15
136. H.-K. Hwang, Théorémes limites pour les structures combinatoires et les fonctions
arithmétiques. PhD thesis, École polytechnique, Palaiseau, 1994
137. H.-K. Hwang, On convergence rates in the central limit theorems for combinatorial structures.
Eur. J. Comb. 19(3), 329–343 (1998)
138. H.-K. Hwang, J.-M. Steyaert, On the number of heaps and the cost of heap construction, in
Mathematics and Computer Science (2002), pp. 295–310
139. J. Jabbour-Hattab, Martingales and large deviations for binary search trees. Random Struct.
Algoritm. 19, 112–127 (2001)
140. J. Jabbour-Hattab, Une approche probabiliste du profil des arbres binaires de recherche. PhD
thesis, Université de Versailles, 2001. http://tinyurl.com/theseJabbourHattab
141. P. Jacquet, M. Régnier, Trie partitioning process: limiting distributions, in CAAP’86, ed.
by P. Franchi-Zanetacchi. Proceedings of the 11th Colloquium on Trees in Algebra and
Programming, Nice, LNCS, vol. 214 (Springer, Berlin, 1986), pp. 196–210
142. P. Jacquet, M. Régnier, New results on the size of tries. IEEE Trans. Inf. Theory 35(1),
203–205 (1989)
143. P. Jacquet, W. Szpankowski, Analysis of digital tries with markovian dependency. IEEE
Trans. Inf. Theory 37(5), 1470–1475 (1991)
144. P. Jacquet, W. Szpankowski, Autocorrelation on words and its applications: analysis of suffix
trees by string-ruler approach. J. Comb. Theory (A) 66(2), 237–269 (1994)
145. P. Jacquet, W. Szpankowski, Asymptotic behavior of the Lempel-Ziv parsing scheme and
digital search trees. Theor. Comput. Sci. 144(1–2), 161–197 (1995)
146. P. Jacquet, W. Szpankowski, Analytic Pattern Matching: From DNA to Twitter (Cambridge
University Press, Cambridge, 2015)
147. S. Janson, Functional limit theorem for multitype branching processes and generalized Pólya
urns. Stoch. Process. Appl. 110, 177–245 (2004)
148. S. Janson, Conditioned Galton–Watson trees do not grow, in Fourth Colloquium on
Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
(2006), pp. 331–334
149. S. Janson, Simply generated trees, conditioned Galton-Watson trees, random allocations and
condensation. Probab. Surv. 9, 103–252 (2012)
150. S. Janson, W. Szpankowski, Analysis of an asymmetric leader election algorithm. Electron.
J. Comb. 9 (1997)
Bibliographie
124. G. Grimmett, Random labelled trees and their branching networks. J. Aust. Math. Soc. (Ser.
A) 30, 229–237 (1980)
125. G. Grimmett, D. Stirzaker, Probability and Random Processes (Oxford University Press,
Oxford, 1982). Third edition, 2001
126. D. Gusfield, Algorithm on Strings, Trees, and Sequences: Computer Science and Computational Biology (Cambridge University Press, New York, 1997)
127. R. Hayward, C. McDiarmid. Average-case analysis of heap building by repeated insertion. J.
Algorithm. 12(1), 126–153 (1991)
128. P. Hennequin, Combinatorial analysis of quicksort algorithm. RAIRO Inform. Théor. Appl.
23(3), 317–333 (1989)
129. P. Hennequin, Analyse en moyenne d’algorithmes : Tri rapide et arbres de recherche. PhD
thesis, École Polytechnique, Palaiseau, 1991, 170 pp.
130. E. Hille, Analytic Function Theory, 2 vols (Blaisdell Publishing Company, Waltham, 1962)
131. C. Hoare, Quicksort. Comput. J. 10–15 (1962)
132. M. Hofri, Probabilistic Analysis of Algorithms (Springer, Berlin, 1987)
133. M. Hofri, Analysis of Algorithms. Computational Methods and Mathematical Tools (Oxford
University Press, Oxford, 1995)
134. Y. Hu, Z. Shi, Minimal position and critical martingale convergence in branching random
walks, and directed polymers on disordered trees. Ann. Probab. 37(2), 742–789 (2009)
135. K. Hun, B. Vallée. Typical depth of a digital search tree built on a general source, in
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics,
ANALCO 2014, Portland, 6 January 2014, pp. 1–15
136. H.-K. Hwang, Théorémes limites pour les structures combinatoires et les fonctions
arithmétiques. PhD thesis, École polytechnique, Palaiseau, 1994
137. H.-K. Hwang, On convergence rates in the central limit theorems for combinatorial structures.
Eur. J. Comb. 19(3), 329–343 (1998)
138. H.-K. Hwang, J.-M. Steyaert, On the number of heaps and the cost of heap construction, in
Mathematics and Computer Science (2002), pp. 295–310
139. J. Jabbour-Hattab, Martingales and large deviations for binary search trees. Random Struct.
Algoritm. 19, 112–127 (2001)
140. J. Jabbour-Hattab, Une approche probabiliste du profil des arbres binaires de recherche. PhD
thesis, Université de Versailles, 2001. http://tinyurl.com/theseJabbourHattab
141. P. Jacquet, M. Régnier, Trie partitioning process: limiting distributions, in CAAP’86, ed.
by P. Franchi-Zanetacchi. Proceedings of the 11th Colloquium on Trees in Algebra and
Programming, Nice, LNCS, vol. 214 (Springer, Berlin, 1986), pp. 196–210
142. P. Jacquet, M. Régnier, New results on the size of tries. IEEE Trans. Inf. Theory 35(1),
203–205 (1989)
143. P. Jacquet, W. Szpankowski, Analysis of digital tries with markovian dependency. IEEE
Trans. Inf. Theory 37(5), 1470–1475 (1991)
144. P. Jacquet, W. Szpankowski, Autocorrelation on words and its applications: analysis of suffix
trees by string-ruler approach. J. Comb. Theory (A) 66(2), 237–269 (1994)
145. P. Jacquet, W. Szpankowski, Asymptotic behavior of the Lempel-Ziv parsing scheme and
digital search trees. Theor. Comput. Sci. 144(1–2), 161–197 (1995)
146. P. Jacquet, W. Szpankowski, Analytic Pattern Matching: From DNA to Twitter (Cambridge
University Press, Cambridge, 2015)
147. S. Janson, Functional limit theorem for multitype branching processes and generalized Pólya
urns. Stoch. Process. Appl. 110, 177–245 (2004)
148. S. Janson, Conditioned Galton–Watson trees do not grow, in Fourth Colloquium on
Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
(2006), pp. 331–334
149. S. Janson, Simply generated trees, conditioned Galton-Watson trees, random allocations and
condensation. Probab. Surv. 9, 103–252 (2012)
150. S. Janson, W. Szpankowski, Analysis of an asymmetric leader election algorithm. Electron.
J. Comb. 9 (1997)