F. Bergeron, G. Labelle, and P. Leroux, Combinatorial species and tree-like structures, 1998.
DOI : 10.1017/CBO9781107325913

P. [. Duchon, G. Flajolet, G. Louchard, and . Schaeffer, Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.4-5577, 2004.
DOI : 10.1109/WSC.2011.6147745
URL : https://hal.archives-ouvertes.fr/hal-00654267

]. A. Dgg-+-06, M. C. Denise, S. D. Gaudel, R. Gouraud, S. Lassaigne et al., Uniform random sampling of traces in very large models, Proceedings of the 1st international workshop on Random testing, p.19, 2006.

P. [. Denise and . Zimmermann, Uniform random generation of decomposable structures using floating-point arithmetic, Theoretical Computer Science, vol.218, issue.2, pp.233-248, 1999.
DOI : 10.1016/S0304-3975(98)00323-5
URL : https://hal.archives-ouvertes.fr/inria-00073447

´. [. Flajolet, C. Fusy, and . Pivoteau, Boltzmann Sampling of Unlabelled Structures, Proceedings of ANALCO, vol.7, 2007.
DOI : 10.1137/1.9781611972979.5
URL : https://hal.archives-ouvertes.fr/hal-00782866

P. Flajolet, D. Gardy, and L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, FS08] P. Flajolet and R. Sedgewick. Analytic combinatorics, p.229, 1992.
DOI : 10.1016/0166-218X(92)90177-C
URL : https://hal.archives-ouvertes.fr/inria-00075832

M. [. Mishna and . Zabrocki, Analytic aspects of the shuffle product, 25th International Symposium on Theoretical Aspects of Computer Science Schloss Dagstuhl ? Leibniz-Zentrum für Informatik Nijenhuis and H.S. Wilf. Combinatorial algorithms, pp.561-572, 1975.
URL : https://hal.archives-ouvertes.fr/hal-00255817