, Une discussion plus élaborée sur les structures de données sera présentée dans [CDJ] 2. On reconnait ici le même phénomène que pour l'automate reconnaissant ? * u [CR02] : lorsque l'on ajoute une lettre, il faut trouver le plus grand suffixe du nouveau mot qui est un préfixe de u The Design and Analysis of Computer Algorithms, Series in Computer Science and Information Processing, 1974.
, Uniform generation of a motzkin word, Theoret. Comput. Sci, vol.134, issue.2, pp.529-536, 1994.
, Efficient algorithms for mining frequent and closed patterns from semi-structured data, Lecture Notes in Computer Science, vol.5012, pp.2-13, 2008.
, A linear-time algorithm for the generation of trees, Algorithmica, vol.83, issue.13, 1997.
DOI : 10.1007/BF02522824
URL : https://hal.archives-ouvertes.fr/inria-00073765
, Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification, ANALCO, pp.52-61, 2013.
DOI : 10.1137/1.9781611973037.7
URL : https://hal.archives-ouvertes.fr/hal-00989647
, Efficient random sampling of binary and unary-binary trees via holonomic equations. ArXiv e-prints, 2014.
, Weakly directed self-avoiding walks, Journal of Combinatorial Theory, Series A, vol.118, issue.8, pp.2365-2391, 2011.
DOI : 10.1016/j.jcta.2011.06.001
URL : https://hal.archives-ouvertes.fr/hal-00526784
, Combinatorial specification of permutation classes, Proceedings of FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics), volume AR, pp.781-792, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00685023
, The asymptotic number of labeled graphs with given degree sequences, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.296-307, 1978.
DOI : 10.1016/0097-3165(78)90059-6
, Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes, Discrete Geometry for Computer Imagery (DGCI), 2013.
DOI : 10.1007/978-3-642-37067-0_9
URL : https://hal.archives-ouvertes.fr/hal-00832016
, Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications, 2014.
DOI : 10.1145/355744.355749
URL : https://hal.archives-ouvertes.fr/hal-00932993
, Enumeration and random generation of possibly incomplete deterministic automata, Pure Mathematics and Applications, vol.19, issue.2-3, pp.1-16, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00452748
, Asymptotic methods in enumeration, SIAM, vol.16, issue.4, pp.485-515, 1974.
, Increasing forests and quadrangulations via a bijective approach, J. Combin. Theory Ser. A, vol.122, issue.0, pp.107-125, 2014.
, An unbiased pointing operator for unlabeled structures, with applications to counting and sampling, SODA '07 : Proceedings of the eighteenth annual ACM- SIAM symposium on Discrete algorithms, pp.356-365, 2007.
, Random Sampling of Plane Partitions, Combinatorics, Probability and Computing, vol.1, issue.02, pp.201-226, 2010.
DOI : 10.1112/plms/s1-33.1.97
URL : https://hal.archives-ouvertes.fr/hal-01351390
, Pattern-avoiding Dyck paths, Proceedings of FPSAC 2013 (25th International Conference on Formal Power Series and Algebraic Combinatorics), 2013.
URL : https://hal.archives-ouvertes.fr/hal-01229675
, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, Random Structures and Algorithms, vol.15, issue.3, pp.3-4194, 2001.
DOI : 10.1002/rsa.10021
URL : https://hal.archives-ouvertes.fr/inria-00108014
, On the asymptotic number of BCK(2)- terms, ANALCO, workshop on ANALytic COmbinatorics, 2014.
, Lambda terms of bounded unary height, ANALCO, workshop on ANALytic COmbinatorics, 2011.
DOI : 10.1137/1.9781611973013.3
, Enumeration of generalized bci lambda-terms, 2013.
, Asymptotics and random sampling for formulae in intuitionist logical systems, Generation Aleatoire de Structure Combinatoire (Gascom'10), 2010.
, Asymptotics and random sampling for BCI and BCK lambda terms, Theoretical Computer Science, vol.502, pp.227-238, 2013.
DOI : 10.1016/j.tcs.2013.01.008
, Boys-and-girls birthdays and Hadamard products, Proceedings of Lattice Paths and Applications'10, p.5, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00641077
, Boltzmann samplers for colored combinatorial objects, Generation Aleatoire de Structure Combinatoire (Gascom'08), 2008.
URL : https://hal.archives-ouvertes.fr/hal-00432211
, Boltzmann samplers for -balanced cycles, Theoretical Computer Science, vol.502, pp.55-63, 2013.
DOI : 10.1016/j.tcs.2012.03.048
, Dirichlet Random Samplers for Multiplicative Structures, Proceedings of the Ninth Meeting on Analytic Algorithmics and Combinatorics (ANALCO'12), pp.92-106, 2012.
DOI : 10.1137/1.9781611973020.12
, Combinatorial Species and Treelike Structures, 1998.
, Asymptotic properties of some minorclosed classes of graphs, 25th International Conference on Formal Power Series and Algebraic Combinatorics, p.2013, 2013.
, Enumeration and random generation of accessible automata, Theoretical Computer Science, vol.381, issue.1-3, pp.86-104, 2007.
DOI : 10.1016/j.tcs.2007.04.001
URL : https://hal.archives-ouvertes.fr/hal-00459712
, Autour de la génération aléatoire sous modèle de Boltzmann. Habilitation à diriger des recherches, 2011.
, Multi-dimensional Boltzmann sampling of languages, DMTCS Proceedings, vol.0, issue.01, pp.49-64, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00450763
, The random generation of underdiagonal walks, Proceedings of 4th Conference on Formal Power Series and Algebraic Combinatorics (FPSAC'92), 1992.
DOI : 10.1016/0012-365X(94)00121-X
, On a certain weighted partition function, Proc. Amer, pp.192-204, 1950.
, Boltzmann samplers for first order combinatorial differential equations, Discrete Applied Mathematics, 2012.
, Algorithmic number theory, Foundations of Computing Series, 1996.
, Fast and sound random generation for automated testing and benchmarking in objective Caml, Proceedings of the 2009 ACM SIGPLAN workshop on ML, ML '09, pp.61-70, 2009.
DOI : 10.1145/1596627.1596637
URL : https://hal.archives-ouvertes.fr/hal-00391817
, Random sampling of ordered trees according to the number of occurences of a pattern
, The Distribution of Patterns in Random Trees, Combinatorics, Probability and Computing, vol.30, issue.01, pp.21-59, 2008.
DOI : 10.1002/(SICI)1098-2418(199701/03)10:1/23.0.CO;2-Z
URL : https://hal.archives-ouvertes.fr/inria-00001281
, On the Diameter of Random Planar Graphs, 21st International Meeting on Probabilistic, Combinatorial , and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings, pp.65-78, 2010.
DOI : 10.4153/CJM-1963-029-x
URL : https://hal.archives-ouvertes.fr/hal-00714713
, Tree Pattern Matching to Subset Matching in Linear Time, SIAM Journal on Computing, vol.32, issue.4, pp.1056-1066, 2003.
DOI : 10.1137/S0097539700382704
, An Unsolvable Problem of Elementary Number Theory
, Introduction à l'algorithmique, 1994.
, Introduction to Algorithms, 2009.
, Discrete Curvature Based on Osculating Circle Estimation, Proceedings of the 4th International Workshop on Visual Form, pp.303-312, 2001.
DOI : 10.1007/3-540-45129-3_27
, Advanced combinatorics, 1974.
, Jewels of stringology, World Scientific, 2002.
DOI : 10.1142/4838
URL : https://hal.archives-ouvertes.fr/hal-00619795
, Random XML sampling the Boltzmann way Arxiv preprint, 2008.
, THE AVERAGE HEIGHT OF PLANTED PLANE TREES, 1971.
DOI : 10.1016/B978-1-4832-3187-7.50007-6
, Non-Uniform Random Variate Generation(originally published with, 1986.
, Boltzmann samplers for the random generation of combinatorial structures, Combinatorics , Probability and Computing, vol.13, pp.577-625, 2004.
, Asymptotically almost all ?-terms are strongly normalizing, 2010.
, Interpr??tation bijective d'une r??currence des nombres de Motzkin, Discrete Mathematics, vol.256, issue.3, pp.671-676, 2002.
DOI : 10.1016/S0012-365X(02)00342-4
, Biased Boltzmann samplers and generation of extended linear languages with shuffle, Proceedings of the 23rd International Meeting on Probabilistic, Combinatorial , and Asymptotic Methods in the Analysis of Algorithms (AofA'12), pp.125-140, 2010.
, Boltzmann sampler for the shuffle product, Proceedings of Gascom'10, 2010.
, Controlled non-uniform random generation of decomposable structures, Theoretical Computer Science, vol.411, issue.40-42, 2010.
DOI : 10.1016/j.tcs.2010.05.010
URL : https://hal.archives-ouvertes.fr/hal-00483581
, Random generation of combinatorial structures : Boltzmann samplers and beyond, Winter Simulation Conference, pp.120-132, 2011.
, Boltzmann sampling of unlabelled structures, Proceedings of ANALCO'07 (Analytic Combinatorics and Algorithms) Conference, pp.201-211, 2007.
, Classical and Intuitionistic Logic Are Asymptotically Identical, 16th Annual Conference on Computer Science Logic (EACSL), pp.177-193, 2007.
DOI : 10.1007/978-3-540-74915-8_16
URL : https://hal.archives-ouvertes.fr/hal-00530534
, Analytic variations on the Airy distribution, Algorithmica, issue.3, pp.31361-377, 2001.
, Subtree matching by deterministic pushdown automata, 2009 International Multiconference on Computer Science and Information Technology, pp.659-666, 2009.
DOI : 10.1109/IMCSIT.2009.5352769
, Probabilities on Cladograms : Introduction to the Alpha Model, 2006.
, On the analysis of linear probing hashing, Algorithmica, vol.22, pp.490-515, 1998.
, Analytic combinatorics, 2009.
, Analytic Combinatorics, 2009.
, Automatic average-case analysis of algorithm, Theoretical Computer Science, vol.79, issue.1, pp.37-109, 1991.
, Quadratic exact-size and linear approximate-size generation of planar graphs, International Conference on Analysis of Algorithms, volume AD, pp.125-138, 2005.
, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.12, pp.1-35, 1994.
, Random generation using binomialapproximations . AofA '10, pp.359-372, 2010.
, Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System, International Symposium on Logical Foundations of Computer Science Iséki. Corrections to Proc. Japan Acad.II65b] Y. Imai and K. Iséki. On axiom systems of propositional calculi I. Proc, pp.280-294231, 1965.
DOI : 10.1017/S0960129599002959
URL : https://hal.archives-ouvertes.fr/hal-00530515
, On the number of digital convex polygons inscribed into an (m, m)-grid Iséki and Sh. Tanaka. An introduction to the theory of BCK-algebras, IEEE Transactions on Information Theory Math. Japon, vol.41, issue.231, pp.436-4391681, 1965.
, A Theory of Positive Integers in Formal Logic, J. Math, vol.57, issue.1, pp.153-173, 1935.
, Comparison of discrete curvature estimators and application to corner detection, Proceedings of the 4th International Symposium on Advances in Visual Computing, ISVC '08, pp.219-244, 1935.
, The Art of Computer Programming : Fundamental Algorithms The art of computer programming) : seminumerical algorithms, 1997.
, Optimal discrete uniform generation from coin flips, and applications. CoRR, abs/1304, 1916.
, Generating random binary trees ??? A survey, Information Sciences, vol.115, issue.1-4, pp.123-136, 1999.
DOI : 10.1016/S0020-0255(98)10080-4
, Uniform random generation of huge metamodel instances. Model Driven Architecture- Foundations and Applications, pp.130-145, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00391816
, A Holonomic Systems Approach to Algebraic Combinatorics. Publications du Laboratoire de combinatoire et d'informatique mathématique, 2005.
, Statistical properties of simple types, Mathematical Structures in Computer Science, vol.10, issue.5, pp.575-594, 2000.
DOI : 10.1017/S0960129599002959
, Combinatorial algorithms, 1978.
, Combinatoire et algorithmique dans les classes de permutations, Thèse, 2013.
, Génération aléatoire de structures combinatoires : méthode de Boltzmann effective, 2008.
, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds, 2011.
DOI : 10.1007/978-1-4612-4664-0
, Boltzmann oracle for combinatorial systems, Proceedings of the Fifth Colloquium on Mathematics and Computer Science, pp.475-488, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00346845
, Algorithms for combinatorial structures: Well-founded systems and Newton iterations, Journal of Combinatorial Theory, Series A, vol.119, issue.8, pp.1711-1773, 2012.
DOI : 10.1016/j.jcta.2012.05.007
URL : https://hal.archives-ouvertes.fr/inria-00622853
, Notes on Introductory Combinatorics . Modern Birkhäuser Classics, 2009.
, Regenerative tree growth: Binary self-similar continuum random trees and Poisson???Dirichlet compositions, The Annals of Probability, vol.37, issue.5, pp.1999-2041, 2009.
DOI : 10.1214/08-AOP445
, Un procédé itératif de dénombrement d'arbres binaires et son application a leur génération aléatoire, ITA, vol.19, issue.2, pp.179-195, 1985.
, Génération aléatoire de structures ordonnées par le modèle de Boltzmann
, Boltzmann sampling of ordered structures, Electronic Notes in Discrete Mathematics, vol.35, pp.305-310, 2009.
DOI : 10.1016/j.endm.2009.11.050
URL : https://hal.archives-ouvertes.fr/hal-01294656
, Patterns and pattern-matching in trees: An analysis, Information and Control, vol.58, issue.1-3, pp.1-319, 1983.
DOI : 10.1016/S0019-9958(83)80056-4
, A mathematical theory of communication, Bell System Technical Journal, vol.27, pp.379-423, 1948.
, On-line encyclopedia of integer sequences. publié sous forme électronique à http
, GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable, ACM Transactions on Mathematical Software, vol.20, issue.2, pp.163-177, 1994.
DOI : 10.1145/178365.178368
URL : https://hal.archives-ouvertes.fr/hal-00917741
, Amortized computational complexity, SIAM Journal on Algebraic and Discrete Methods, vol.6, issue.2, pp.306-318, 1985.
, The Theory of the Riemann Zeta-Function, 1986.
, Graph Theory. Cambridge Mathematical Library, 2001.
, An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps, Theoretical Computer Science, vol.411, pp.2945-2967, 2010.
, Counting rooted and unrooted triangular maps, Journal of Non-linear Systems and Applications, pp.51-57, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00824982
, The method of creative telescoping, J. Symbolic Comput, vol.11, issue.3, pp.195-204, 1991.