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
Complexity of Anticipated Rejection Algorithms and the Darling???Mandelbrot Distribution, AofA, 2014. ,
DOI : 10.1007/s00453-015-0040-8
Basic analytic combinatorics of directed lattice paths, Theoretical Computer Science, vol.281, issue.1-2, pp.37-80, 2002. ,
DOI : 10.1016/S0304-3975(02)00007-5
Three dimensional lattice walks restricted to the positive octant, Annals of Combinatorics ,
Automatic classification of restricted lattice walks, DMTCS Proceedings of the 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC'09), pp.203-217, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00780428
On the Importance Sampling of Self-Avoiding Walks, Combinatorics, Probability and Computing, vol.50, issue.05, pp.1-24, 2011. ,
DOI : 10.1023/A:1013750203191
Walks with small steps in the quarter plane, Algorithmic probability and combinatorics, pp.1-39, 2010. ,
DOI : 10.1090/conm/520/10252
Culminating paths, Discrete Math. Theor. Comput. Sci, vol.10, issue.2, pp.125-152, 2008. ,
Random walks in cones, The Annals of Probability, vol.43, issue.3, pp.992-1044, 2015. ,
DOI : 10.1214/13-AOP867
Nonuniform random variate generation, 1986. ,
On the enumeration and generation of generalized Dyck words, Formal power series and algebraic combinatorics, pp.121-135, 1998. ,
DOI : 10.1016/S0012-365X(00)00150-3
URL : https://hal.archives-ouvertes.fr/hal-00307151
Random Sampling from Boltzmann Principles, Automata, Languages, and Programming, number 2380 in Lecture Notes in Computer Science, pp.501-513, 2002. ,
DOI : 10.1007/3-540-45465-9_43
URL : https://hal.archives-ouvertes.fr/inria-00100938
Random walks in cones: the case of nonzero drift. Stochastic Process, Appl, vol.124, issue.4, pp.1503-1518, 2014. ,
A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994. ,
DOI : 10.1016/0304-3975(94)90226-7
URL : https://hal.archives-ouvertes.fr/hal-00917729
On the exit time from a cone for brownian motion with drift, Electronic Journal of Probability, vol.19, issue.0, 2014. ,
DOI : 10.1214/EJP.v19-3169
URL : https://hal.archives-ouvertes.fr/hal-00880523
Random generation of words in an algebraic language in linear binary space, Information Processing Letters, vol.54, issue.4, pp.229-233, 1995. ,
DOI : 10.1016/0020-0190(95)00025-8
Towards a combinatorial understanding of lattice path asymptotics, 2013. ,
Random walks in $(\mathbb{Z}_{+})^{2}$ with non-zero drift absorbed at the axes, Bulletin de la Société mathématique de France, vol.139, issue.3, pp.341-387, 2011. ,
DOI : 10.24033/bsmf.2611
URL : https://hal.archives-ouvertes.fr/hal-00696352
Boltzmann oracle for combinatorial systems, Algorithms, Trees, Combinatorics and Probabilities Proceedings of the Fifth Colloquium on Mathematics and Computer Science, pp.475-488, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00346845
Counting walks in a quadrant: a unified approach via boundary value problems, Journal of the European Mathematical Society, vol.14, issue.3, pp.749-777, 2012. ,
DOI : 10.4171/JEMS/317
URL : https://hal.archives-ouvertes.fr/hal-00461853
A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects, Advances in Mathematics, vol.24, pp.281-291, 1977. ,