A. Denise, M. Gaudel, S. Gouraud, R. Lassaigne, and S. Peyronnet, Uniform random sampling of traces in very large models, Proceedings of the 1st international workshop on Random testing , RT '06, pp.10-19, 2006.
DOI : 10.1145/1145735.1145738
URL : https://hal.archives-ouvertes.fr/hal-00080471

A. Denise, O. Roques, and M. Termier, Random generation of words of context-free languages according to the frequencies of letters, Trends in Mathematics, Birkhaüser, pp.113-125, 2000.
DOI : 10.1007/978-3-0348-8405-1_10

A. Denise and P. 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

Y. Ding and E. Lawrence, A statistical sampling algorithm for RNA secondary structure prediction, Nucleic Acids Research, vol.31, issue.24, pp.7280-7301, 2003.
DOI : 10.1093/nar/gkg938

M. Drmota, Systems of functional equations, Random Struct, Alg, vol.10, pp.103-124, 1997.

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, 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

P. Flajolet, E. Fusy, and C. Pivoteau, Boltzmann Sampling of Unlabelled Structures, Proceedings of ANALCO'07, 2007.
DOI : 10.1137/1.9781611972979.5
URL : https://hal.archives-ouvertes.fr/hal-00782866

P. Flajolet, P. Zimmermann, and B. , 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

P. Flajolet, L. Danì-ele-gardy, and . Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Applied Mathematics, vol.39, issue.3, pp.207-229, 1992.
DOI : 10.1016/0166-218X(92)90177-C
URL : https://hal.archives-ouvertes.fr/inria-00075832

M. Goldwurm, 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

S. P. Lalley, Finite Range Random Walk on Free Groups and Homogeneous Trees, The Annals of Probability, vol.21, issue.4, pp.2087-2130, 1993.
DOI : 10.1214/aop/1176989012

Y. Ponty, M. Termier, and A. Denise, GenRGenS: software for generating random genomic sequences and structures, Bioinformatics, vol.22, issue.12, pp.1534-1535, 2006.
DOI : 10.1093/bioinformatics/btl113
URL : https://hal.archives-ouvertes.fr/inria-00548871

B. Salvy and P. Zimmerman, 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

J. Van-der-hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, pp.479-542, 2002.
DOI : 10.1006/jsco.2002.0562

H. S. Wilf, A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects, Advances in Mathematics, vol.24, issue.2, pp.281-291, 1977.
DOI : 10.1016/S0001-8708(77)80046-7

A. R. Woods, Coloring rules for finite trees, and probabilities of monadic second order sentences , Random Struct, Alg, vol.10, pp.453-485, 1997.

P. Zimmermann, Uniform random generation for the powerset construction, Proceedings of the 7th conference on Formal Power Series and Algebraic Combinatorics, pp.589-600, 1995.
URL : https://hal.archives-ouvertes.fr/hal-00917748