Combinatorial species and tree-like structures. Number 67 in Encyclopedia of Mathematics and its Applications, 1998. ,
DOI : 10.1017/cbo9781107325913
Autour de la génération aléatoire sous modèle de Boltzmann. Habilitation memoir, 2010. ,
Boys-and-girls birthdays and Hadamard products, Proceedings of Lattice Paths Combinatorics and Applications, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00641077
Multi-dimensional Boltzmann sampling of languages, Proceedings of the 21st International Meeting on Probabilistic, Combinatorial , and Asymptotic Methods in the Analysis of Algorithms (AofA'10) DMTCS Proceedings, pp.49-64, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00450763
Boltzmann samplers for first-order differential specifications, Discrete Applied Mathematics, vol.160, issue.18, 2011. ,
DOI : 10.1016/j.dam.2012.05.022
URL : https://hal.archives-ouvertes.fr/hal-00641072
Exact Boltzmann samplers from adaptive approximate oracles, preparation, 2011. ,
Random Sampling from Boltzmann Principles, Proceedings of the 29th ICALP, volume 2380 of Lecture Notes in Computer Science, pp.501-513 ,
DOI : 10.1007/3-540-45465-9_43
URL : https://hal.archives-ouvertes.fr/inria-00100938
Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.577-625, 2004. ,
DOI : 10.1109/WSC.2011.6147745
URL : https://hal.archives-ouvertes.fr/hal-00654267
Boltzmann sampling of unlabeled structures, Proceedings of ANALCO 07, pp.201-211, 2007. ,
Analytic combinatorics, 2009. ,
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739
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
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
How to get a perfectly random sample from a generic markov chain and generate a random spanning tree of a directed graph, J. Algorithms, vol.27, issue.2, pp.170-217, 1998. ,
Un procédé itératif de dénombrement d'arbres binaires et son applicationàtion`tionà leur génération aléatoire, pp.179-195, 1985. ,
Boltzmann sampling of ordered structures, Proceedings of LAGOS 09, 2009. ,
DOI : 10.1016/j.endm.2009.11.050
URL : https://hal.archives-ouvertes.fr/hal-01294656