V. Baladi and B. Vallée, Exponential Decay of Correlations for surface semi-flows without finite Markov partitions, Proceedings of the, pp.865-874, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00012765

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

R. P. Brent, Analysis of the Binary Euclidean algorithm, Algorithms and Complexity, New directions and recent results, pp.321-355, 1976.

G. Cesari, Parallel Implementation of Schönhage's Integer GCD Algorithm, Proceedings of ANTS-III, pp.64-76

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

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

B. Daireaux, V. Maume-deschamps, and B. Vallée, The Lyapounov Tortoise and the Dyadic hare, Discrete Mathematics and Theoretical Computer Science, Proceedings of AofA'05, pp.71-94, 2005.

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 and R. Sedgewick, Analytic Combinatorics, Book in preparation (1999), see also INRIA Research Reports, 1888.

M. Fürer, Faster Integer Multiplication, Proceedings of STOC'07, pp.57-66

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

H. Hwang, On Convergence Rates in the Central Limit Theorems for Combinatorial Structures, European Journal of Combinatorics, vol.19, issue.3, pp.329-343, 1998.
DOI : 10.1006/eujc.1997.0179

T. Jebelean, Practical integer division with Karatsuba complexity, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97
DOI : 10.1145/258726.258836

T. Jebelean, A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers, Journal of Symbolic Computation, vol.19, issue.1-3, pp.145-157, 1995.
DOI : 10.1006/jsco.1995.1009

D. E. Knuth, The art of Computer programming, 1998.

D. E. Knuth, The analysis of algorithms, Actes du Congrès des Mathématiciens, vol.3, pp.269-274, 1971.

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 and B. Vallée, Gaussian Laws for the main parameters of the Euclid Algorithm, to appear in Algorithmica (2007) ?Short version : Sharp estimates for the main parameters of the Euclid Algorithm, Proceedings of LATIN'06, pp.689-702

D. Stehlé and P. Zimmermann, A Binary Recursive Gcd Algorithm, Proceedings of ANTS'04, pp.411-425, 2004.
DOI : 10.1007/978-3-540-24847-7_31

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, Euclidean dynamics, Discrete and Continuous Dynamical Systems, pp.281-352, 2006.
DOI : 10.3934/dcds.2006.15.281

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

C. K. Yap, Fundamental Problems in Algorithmic Algebra, 1996.

E. Cesaratto, A. , G. , and U. Cnrs, Université de Caen and ENSICAEN, F-14032 Caen, France. ecesara@fi.uba.ar Julien Clément : GREYC, UMR CNRS 6072, Université de Caen and ENSICAEN, F-14032 Caen, France. julien.clement@info.unicaen.fr Beno??tBeno??t Daireaux: IrisResearch Center, Daireaux@irisresearch.no Lo¨?ckLo¨?ck Lhote: GREYC, UMR CNRS 6072, p.14032

V. Maume-deschamps, Institut de ScienceFinancì ere et d'Assurances -ISFA Université Lyon 1, France. veronique.maume@univ-lyon1