B. , C. Bousquet-m-´-elou, M. Denise, A. Flajolet, P. And-gardy et al., Generating functions for generating trees, Discrete Math, vol.246, pp.1-3, 2002.

B. , C. And-flajolet, and P. , Basic analytic combinatorics of directed lattice paths, Theoretical Computer Science, vol.281, issue.12, pp.37-80, 2002.

B. , C. Flajolet, P. Schaeffer, G. And, and M. Soria, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, Random Struct. Algorithms, vol.19, pp.3-4, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00108014

B. , C. And-gittenberger, and B. , Analytic combinatorics of lattice paths: Enumeration and asymptotics for the average area, Proceedings of the 4th Colloquium of Mathematics and Computer Science), pp.345-355, 2006.

A. Bostan and M. And-kauers, The complete generating function for Gessel walks is algebraic, Proceedings of the American Mathematical Society, vol.138, issue.09, pp.3063-3079, 2010.
DOI : 10.1090/S0002-9939-2010-10398-2
URL : https://hal.archives-ouvertes.fr/hal-00780429

M. Bousquet-m-´-elou and M. And-petkov?ekpetkov?petkov?ek, Linear recurrences with constant coefficients: The multivariate case. Discrete Math, pp.1-3, 2000.

C. , F. Graham, R. Morrison, J. And, and A. Odlyzko, Pebbling a chessboard, Am. Math. Mon, vol.102, issue.2, pp.113-123, 1995.

D. Bruijn, N. G. Knuth, D. E. And-rice, and S. , THE AVERAGE HEIGHT OF PLANTED PLANE TREES, Graph theory and computing, pp.15-22, 1972.
DOI : 10.1016/B978-1-4832-3187-7.50007-6

F. , G. Iasnogorodski, R. And-malyshev, and V. , Random walks in the quarter-plane. Algebraic methods, boundary value problems and applications, Applications of Mathematics, vol.40, issue.160, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01086684

F. , P. And, and A. M. Odlyzko, The average height of binary trees and other simple trees, Journal of Computer and System Sciences, vol.25, issue.2, pp.171-213, 1982.

F. , P. And-sedgewick, and R. , Analytic combinatorics, 2009.

K. , M. Koutschan, C. And-zeilberger, and D. , Proof of Ira Gessel's Lattice Path Conjecture, Proceedings of the National Academy of Sciences, vol.106, issue.28, pp.11502-11505, 2009.

K. , A. Backes, C. And-lenhof, and H. P. , Computation of significance scores of unweighted gene set enrichment analyses, BMC Bioinformatics, vol.290, issue.8, 2007.

K. Koml´os, J. Major, P. And-tusn´adytusn´-tusn´ady, and G. , An approximation of partial sums of independant RV's and the sample DF. I. Wahrscheinlichkeittheorie und Verw, Gebiete, pp.32-111, 1976.

K. , I. A. And-suhov, and Y. M. , Malyshev's theory and JS-queues. Asymptotics of stationary probabilities, Ann. Appl. Probab, vol.13, issue.4, pp.1313-1354, 2003.

P. , A. And-prodinger, and H. , Towards a more precise analysis of an algorithm to generate binary trees: A tutorial, The Computer Journal, vol.41, pp.201-204, 1998.