A. Akhavi and B. Vallée, Average Bit-Complexity of Euclidean Algorithms, Proceedings of ICALP'2000, Lecture Notes in Computer Science 1853, pp.373-387
DOI : 10.1007/3-540-45022-X_32

V. Baladi and B. Vallée, Euclidean algorithms are Gaussian, Journal of Number Theory, vol.110, issue.2, pp.331-386, 2005.
DOI : 10.1016/j.jnt.2004.08.008
URL : https://hal.archives-ouvertes.fr/hal-00012771

V. Berthé and H. Nakada, On Continued Fraction Expansions in Positive Characteristic: Equivalence Relations and some metric properties, Expositiones Mathematicae, vol.18, pp.257-284, 2000.

E. Cesaratto, Remarks on the paper Euclidean Algorithms are gaussian " by V. Baladi and B. Vallée, personal communication

B. Daireaux and B. Vallée, Dynamical analysis of the parameterized Lehmer, pp.499-536, 2004.

E. Cesaratto, J. Clément, B. Daireaux, L. Lhote, V. Maume-deschamps et al., Analysis of fast versions of the Euclid Algorithm, see web page: www, Proceedings of ANALCO'07

H. Delange, Généralisation du Théorème d'Ikehara, Ann. Sc. ENS, vol.71, pp.213-242, 1954.

J. Dixon, The number of steps in the Euclidean algorithm, Journal of Number Theory, vol.2, issue.4, pp.414-422, 1970.
DOI : 10.1016/0022-314X(70)90044-2

D. Dolgopyat, On Decay of Correlations in Anosov Flows, The Annals of Mathematics, vol.147, issue.2, pp.357-390, 1998.
DOI : 10.2307/121012

P. Flajolet, Notes de DEA, personal communication [12] Flajolet, P. and Sedgewick, R. Analytic Combinatorics, Book in preparation (1999), see also INRIA Research Reports, 1888.

S. R. Finch, Mathematical Constants, 2003.
DOI : 10.1017/CBO9780511550447

C. Friesen and D. Hensley, The statistics of continued fractions for polynomials over a finite field, Proceedings of the, pp.2661-2673, 1996.

H. Heilbronn, On the average length of a class of continued fractions, Number Theory and Analysis, pp.87-96, 1969.

D. Hensley, The Number of Steps in the Euclidean Algorithm, Journal of Number Theory, vol.49, issue.2, pp.142-182, 1994.
DOI : 10.1006/jnth.1994.1088

J. Knopfmacher and A. Knopfmacher, The exact length of the Euclidean algorithm in Fq, pp.35-297, 1988.

D. H. Lehmer, Euclid's Algorithm for Large Numbers, The American Mathematical Monthly, vol.45, issue.4, pp.227-233, 1938.
DOI : 10.2307/2302607

L. Lhote, Computation of a Class of Continued Fraction Constants Proceedings of Alenex?ANALCO04, pp.199-210

L. Lhote and B. Vallée, Sharp Estimates for the Main Parameters of the Euclid Algorithm, Proceedings of LATIN'06, pp.689-702
DOI : 10.1007/11682462_63
URL : https://hal.archives-ouvertes.fr/hal-00210493

W. Philipp, Some metrical theorems in number theory II, Duke Math, J, vol.37, pp.447-488, 1970.

D. Ruelle, Thermodynamic formalism, 1978.
DOI : 10.1017/CBO9780511617546

G. Tenenbaum, IntroductionàIntroductionà la théorie analytique des nombres, InstitutÉlieInstitut´InstitutÉlie Cartan, vol.13, 1990.

B. Vallée, Euclidean Dynamics, Discrete and Continuous Dynamical Systems, pp.281-352, 2006.

B. Vallée, Dynamical analysis of a class of Euclidean algorithms, Theoretical Computer Science, vol.297, issue.1-3, pp.447-486, 2003.
DOI : 10.1016/S0304-3975(02)00652-7

B. Vallée, Digits and continuants in euclidean algorithms. Ergodic versus tauberian theorems, Journal de Th??orie des Nombres de Bordeaux, vol.12, issue.2, pp.531-570, 2000.
DOI : 10.5802/jtnb.296

B. Vallée, Opérateurs de Ruelle-Mayer généralisés et analyse en moyenne des algorithmes de Gauss et d'Euclide, Acta Arithmetica 81, pp.101-144, 1997.

V. Zur-gathen, J. Gerhard, and J. , Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065