{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:13Z","timestamp":1725544753931},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_63","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"689-702","source":"Crossref","is-referenced-by-count":2,"title":["Sharp Estimates for the Main Parameters of the Euclid Algorithm"],"prefix":"10.1007","author":[{"given":"Lo\u00efck","family":"Lhote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brigitte","family":"Vall\u00e9e","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"63_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-45022-X_32","volume-title":"Automata, Languages and Programming","author":"A. Akhavi","year":"2000","unstructured":"Akhavi, A., Vall\u00e9e, B.: Average bit\u2013complexity of Euclidean Algorithms. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 373\u2013387. Springer, Heidelberg (2000)"},{"issue":"2","key":"63_CR2","doi-asserted-by":"publisher","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. Journal of Number Theory\u00a0110(2), 331\u2013386 (2005)","journal-title":"Journal of Number Theory"},{"key":"63_CR3","series-title":"Trends in Mathematics","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-0348-7915-6_46","volume-title":"Proceedings of the Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probability","author":"E. Cesaratto","year":"2004","unstructured":"Cesaratto, E., Vall\u00e9e, B.: Reals with bounded digit averages. In: Drmota, M., et al. (eds.) Proceedings of the Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probability. Trends in Mathematics, pp. 473\u2013490. Birkhauser Verlag, Basel (2004)"},{"key":"63_CR4","doi-asserted-by":"crossref","unstructured":"Daireaux, B., Vall\u00e9e, B.: Dynamical analysis of the parameterized Lehmer-Euclid Algorithm, Combinatorics, Probability, Computing, pp. 499\u2013536 (2004)","DOI":"10.1017\/S0963548304006261"},{"key":"63_CR5","doi-asserted-by":"publisher","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. of Math.\u00a0147, 357\u2013390 (1998)","journal-title":"Ann. of Math."},{"issue":"2","key":"63_CR6","doi-asserted-by":"publisher","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. Journal of Number Theory\u00a049(2), 142\u2013182 (1994)","journal-title":"Journal of Number Theory"},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.2307\/2302607","volume":"45","author":"D.H. Lehmer","year":"1938","unstructured":"Lehmer, D.H.: Euclid\u2019s algorithm for large numbers. Am. Math. Mon.\u00a045, 227\u2013233 (1938)","journal-title":"Am. Math. Mon."},{"key":"63_CR8","unstructured":"Lhote, L.: Computation of a Class of Continued Fraction Constants. In: Proceedings of Alenex\u2013ANALCO 2004, pp. 199\u2013210 (2004)"},{"key":"63_CR9","doi-asserted-by":"publisher","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.\u00a037, 447\u2013488 (1970); Errata. IBID, 788","journal-title":"Duke Math. J."},{"key":"63_CR10","unstructured":"Vall\u00e9e, B.: Euclidean Dynamics. To appear in Discrete and Continuous Dynamical Systems (2005), \n                    \n                      www.info.unicaen.fr\/~brigitte"},{"issue":"2","key":"63_CR11","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 Arithmetica\u00a081(2), 101\u2013144 (1997)","journal-title":"Acta Arithmetica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:05:05Z","timestamp":1552359905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11682462_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}