F. Bergeron, G. Labelle, and P. Leroux, Translated from the 1994 French original by Margaret Readdy, Number 67 in Encyclopedia of Mathematics and its Applications, 1998.

H. Décoste, G. Labelle, and P. Leroux, Une approche combinatoire pour l'itération de Newton-Raphson, Advances in Applied Mathematics, vol.3, issue.4, pp.407-416, 1982.

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Boltzmann samplers for the random generation of combinatorial structures, Combinatorics, Probability and Computing, vol.13, issue.4-5, pp.577-625, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00307530

P. Flajolet, É. Fusy, and C. Pivoteau, Boltzmann sampling of unlabelled structures, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics, vol.126, pp.201-211, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00782866

P. Flajolet, B. Salvy, and P. Zimmermann, Automatic average-case analysis of algorithm, Theor. Comput. Sci, vol.79, issue.1, p.90145, 1991.

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00072739

M. Mishna, Attribute grammars and automatic complexity analysis, Advances in Applied Mathematics, vol.30, pp.189-207, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072620

C. Pivoteau, B. Salvy, and M. Soria, Algorithms for combinatorial structures: Well-founded systems and newton iterations, J. Comb. Theory, Ser. A, vol.119, issue.8, pp.1711-1773, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00622853

J. Joachim-von-zur-gathen and . Gerhard, Modern computer algebra, 2003.