{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:58:57Z","timestamp":1761058737666},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,9,22]],"date-time":"2007-09-22T00:00:00Z","timestamp":1190419200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00453-007-9009-6","type":"journal-article","created":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T19:31:14Z","timestamp":1190403074000},"page":"497-554","source":"Crossref","is-referenced-by-count":12,"title":["Gaussian Laws for the Main Parameters of the Euclid Algorithms"],"prefix":"10.1007","volume":"50","author":[{"given":"Lo\u00efck","family":"Lhote","sequence":"first","affiliation":[]},{"given":"Brigitte","family":"Vall\u00e9e","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,22]]},"reference":[{"key":"9009_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/3-540-45022-X_32","volume-title":"Proceedings of ICALP\u20192000","author":"A. Akhavi","year":"2000","unstructured":"Akhavi, A., Vall\u00e9e, B.: Average bit-complexity of Euclidean algorithms. In: Proceedings of ICALP\u20192000. Lecture Notes in Computer Science, vol.\u00a01853, pp. 373\u2013387. Springer, Berlin (2000)"},{"issue":"2","key":"9009_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.jnt.2004.08.008","volume":"110","author":"V. Baladi","year":"2005","unstructured":"Baladi, V., Vall\u00e9e, B.: Euclidean algorithms are Gaussian. J. Number Theory 110(2), 331\u2013386 (2005)","journal-title":"J. Number Theory"},{"key":"9009_CR3","first-page":"257","volume":"18","author":"V. Berth\u00e9","year":"2000","unstructured":"Berth\u00e9, V., Nakada, H.: On continued fraction expansions in positive characteristic: equivalence relations and some metric properties. Expo. Math. 18, 257\u2013284 (2000)","journal-title":"Expo. Math."},{"key":"9009_CR4","unstructured":"Cesaratto, E.: Remarks on the paper \u201cEuclidean algorithms are gaussian\u201d by V. Baladi and B. Vall\u00e9e, personal communication (submitted)"},{"key":"9009_CR5","unstructured":"Cesaratto, E., Cl\u00e9ment, J., Daireaux, B., Lhote, L., Maume-Deschamps, V., Vall\u00e9e, B.: Analysis of fast versions of the Euclid algorithm, see web page: www.info.unicaen.fr\/~brigitte . Proceedings of ANALCO\u201907 (to appear)"},{"key":"9009_CR6","doi-asserted-by":"crossref","unstructured":"Daireaux, B., Vall\u00e9e, B.: Dynamical analysis of the parameterized Lehmer-Euclid algorithm. Comb. Probab. Comput. 499\u2013536 (2004)","DOI":"10.1017\/S0963548304006261"},{"key":"9009_CR7","first-page":"213","volume":"71","author":"H. Delange","year":"1954","unstructured":"Delange, H.: G\u00e9n\u00e9ralisation du th\u00e9or\u00e8me d\u2019ikehara. Ann. Sc. ENS 71, 213\u2013242 (1954)","journal-title":"Ann. Sc. ENS"},{"key":"9009_CR8","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0022-314X(70)90044-2","volume":"2","author":"J.D. Dixon","year":"1970","unstructured":"Dixon, J.D.: The number of steps in the Euclidean algorithm. J. Number Theory 2, 414\u2013422 (1970)","journal-title":"J. Number Theory"},{"key":"9009_CR9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.2307\/121012","volume":"147","author":"D. Dolgopyat","year":"1998","unstructured":"Dolgopyat, D.: On decay of correlations in Anosov flows. Ann. Math. 147, 357\u2013390 (1998)","journal-title":"Ann. Math."},{"key":"9009_CR10","volume-title":"Prime Numbers","author":"W. Ellison","year":"1985","unstructured":"Ellison, W., Ellison, F.: Prime Numbers. Hermann, Paris (1985)"},{"key":"9009_CR11","unstructured":"Flajolet, P.: Notes de DEA, personal communication"},{"key":"9009_CR12","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Book in preparation (1999). See also INRIA Research Reports 1888, 2026, 2376, 2956"},{"key":"9009_CR13","volume-title":"Mathematical Constants","author":"S.R. Finch","year":"2003","unstructured":"Finch, S.R.: Mathematical Constants. Cambridge University Press, Cambridge (2003)"},{"issue":"9","key":"9009_CR14","doi-asserted-by":"crossref","first-page":"2661","DOI":"10.1090\/S0002-9939-96-03394-1","volume":"124","author":"C. Friesen","year":"1996","unstructured":"Friesen, C., Hensley, D.: The statistics of continued fractions for polynomials over a finite field. Proc. Am. Math. Soc. 124(9), 2661\u20132673 (1996)","journal-title":"Proc. Am. Math. Soc."},{"key":"9009_CR15","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4615-4819-5_7","volume-title":"Number Theory and Analysis","author":"H. Heilbronn","year":"1969","unstructured":"Heilbronn, H.: On the average length of a class of continued fractions. In: Turan, P. (ed.) Number Theory and Analysis, pp. 87\u201396. Plenum, New York (1969)"},{"issue":"2","key":"9009_CR16","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jnth.1994.1088","volume":"49","author":"D. Hensley","year":"1994","unstructured":"Hensley, D.: The number of steps in the Euclidean algorithm. J. Number Theory 49(2), 142\u2013182 (1994)","journal-title":"J. Number Theory"},{"key":"9009_CR17","unstructured":"Hwang, H.-K.: Th\u00e9or\u00e8mes limite pour les structures combinatoires et les fonctions arithm\u00e9tiques. PhD thesis, Ecole Polytechnique (Dec. 1994)"},{"key":"9009_CR18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1112\/S002557930001528X","volume":"35","author":"J. Knopfmacher","year":"1988","unstructured":"Knopfmacher, J., Knopfmacher, A.: The exact length of the Euclidean algorithm in F q [X]. Mathematika 35, 297\u2013304 (1988)","journal-title":"Mathematika"},{"key":"9009_CR19","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1080\/00029890.1938.11990797","volume":"45","author":"D.H. Lehmer","year":"1938","unstructured":"Lehmer, D.H.: Euclid\u2019s algorithm for large numbers. Am. Math. Mon. 45, 227\u2013233 (1938)","journal-title":"Am. Math. Mon."},{"key":"9009_CR20","unstructured":"Lhote, L.: Computation of a Class of Continued Fraction Constants Proceedings of Alenex\u2013ANALCO04, pp. 199\u2013210"},{"key":"9009_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/11682462_63","volume-title":"Proceedings of LATIN\u201906","author":"L. Lhote","year":"2006","unstructured":"Lhote, L., Vall\u00e9e, B.: Sharp estimates for the main parameters of the Euclid algorithm. In: Proceedings of LATIN\u201906. Lecture Notes in Computer Science, vol. 3887, pp. 689\u2013702. Springer, Berlin (2006)"},{"key":"9009_CR22","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1215\/S0012-7094-70-03756-7","volume":"37","author":"W. Philipp","year":"1970","unstructured":"Philipp, W.: Some metrical theorems in number theory II. Duke Math. J. 37, 447\u2013488 (1970). Errata: Duke Math. J. 37, 788 (1970)","journal-title":"Duke Math. J."},{"key":"9009_CR23","volume-title":"Thermodynamic Formalism","author":"D. Ruelle","year":"1978","unstructured":"Ruelle, D.: Thermodynamic Formalism. Addison\u2013Wesley, Reading (1978)"},{"key":"9009_CR24","doi-asserted-by":"crossref","unstructured":"Schonhage, A.: Schnelle Berechnung von Kettenbruchentwicklungen. Acta Inform. pp. 139\u2013144 (1971)","DOI":"10.1007\/BF00289520"},{"key":"9009_CR25","volume-title":"Introduction \u00e0 la Th\u00e9orie Analytique des Nombres","author":"G. Tenenbaum","year":"1990","unstructured":"Tenenbaum, G.: Introduction \u00e0 la Th\u00e9orie Analytique des Nombres, vol.\u00a013. Institut \u00c9lie Cartan, Nancy (1990)"},{"issue":"2","key":"9009_CR26","doi-asserted-by":"crossref","first-page":"101","DOI":"10.4064\/aa-81-2-101-144","volume":"81","author":"B. Vall\u00e9e","year":"1997","unstructured":"Vall\u00e9e, B.: Op\u00e9rateurs de Ruelle-Mayer g\u00e9n\u00e9ralis\u00e9s et analyse en moyenne des algorithmes de Gauss et d\u2019Euclide. Acta Arith. 81(2), 101\u2013144 (1997)","journal-title":"Acta Arith."},{"key":"9009_CR27","doi-asserted-by":"crossref","first-page":"531","DOI":"10.5802\/jtnb.296","volume":"12","author":"B. Vall\u00e9e","year":"2000","unstructured":"Vall\u00e9e, B.: Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems. J.\u00a0Th\u00e9or. Nr. Bordx 12, 531\u2013570 (2000)","journal-title":"J.\u00a0Th\u00e9or. Nr. Bordx"},{"issue":"1-3","key":"9009_CR28","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0304-3975(02)00652-7","volume":"297","author":"B. Vall\u00e9e","year":"2003","unstructured":"Vall\u00e9e, B.: Dynamical analysis of a class of Euclidean algorithms. Theor. Comput. Sci. 297(1-3), 447\u2013486 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9009_CR29","doi-asserted-by":"crossref","first-page":"281","DOI":"10.3934\/dcds.2006.15.281","volume":"15","author":"B. Vall\u00e9e","year":"2006","unstructured":"Vall\u00e9e, B.: Euclidean dynamics. Discrete Contin. Dyn. Syst. 15(1), 281\u2013352 (2006)","journal-title":"Discrete Contin. Dyn. Syst."},{"key":"9009_CR30","volume-title":"Modern Computer Algebra","author":"J. Zur Gathen Von","year":"1999","unstructured":"Von Zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9009-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9009-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9009-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:44:59Z","timestamp":1559137499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9009-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,22]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["9009"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9009-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,22]]}}}