{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T06:45:43Z","timestamp":1776840343298,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540615811","type":"print"},{"value":"9783540706328","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61581-4_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:02:39Z","timestamp":1330275759000},"page":"35-47","source":"Crossref","is-referenced-by-count":9,"title":["A comparative study of algorithms for computing continued fractions of algebraic numbers"],"prefix":"10.1007","author":[{"given":"Richard P.","family":"Brent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred J.","family":"Poorten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herman J. J.","family":"Riele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"4_CR1","first-page":"305","volume":"34","author":"R. P. Brent","year":"1980","unstructured":"Richard P. Brent and Edwin M. McMillan, \u2018Some new algorithms for high-precision computation of Euler's constant', Math. Comp.\n34 (1980), 305\u2013312.","journal-title":"Math. Comp."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-94-017-1108-1_10","volume-title":"Computational Algebra and Number Theory","author":"E. Bombieri","year":"1995","unstructured":"Enrico Bombieri and Alfred J. van der Poorten, \u2018Continued fractions of algebraic numbers', in Computational Algebra and Number Theory, Sydney 1992, Wieb Bosma and Alf van der Poorten eds., (Kluwer, 1995), 137\u2013152."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1090\/S0025-5718-1972-0330118-4","volume":"26","author":"D. G. Cantor","year":"1972","unstructured":"David G. Cantor, Paul G. Galyean and Horst G. Zimmer, \u2018A continued fraction algorithm for real algebraic numbers', Math. Comp.\n26 (1972), 785\u2013791.","journal-title":"Math. Comp."},{"key":"4_CR4","first-page":"361","volume":"1","author":"A. Khintchine","year":"1935","unstructured":"A. Khintchine, \u2018Metrische Kettenbruchprobleme', Compositio Math.\n1 (1935), 361\u2013382.","journal-title":"Compositio Math."},{"key":"4_CR5","volume-title":"The Art of Computer Programming, Volume 2, Seminumerical Algorithms","author":"D. E. Knuth","year":"1981","unstructured":"Donald E. Knuth, The Art of Computer Programming, Volume 2, Seminumerical Algorithms, (Reading, Mass.: Addison-Wesley, Second Edition, 1981).","edition":"Second Edition"},{"key":"4_CR6","first-page":"112","volume":"255","author":"S. Lang","year":"1972","unstructured":"Serge Lang and Hale Trotter, \u2018Continued fractions for some algebraic numbers', J. reine angew. Math., 255 (1972), 112\u2013134.","journal-title":"J. reine angew. Math."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1080\/00029890.1938.11990797","volume":"45","author":"D. H. Lehmer","year":"1983","unstructured":"D. H. Lehmer, \u2018Euclid's algorithm for large numbers', Amer. Math. Monthly, 45 (1983), 227\u2013233.","journal-title":"Amer. Math. Monthly"},{"key":"4_CR8","first-page":"286","volume":"3","author":"P. L\u00e9vy","year":"1936","unstructured":"P. L\u00e9vy, \u2018Sur le d\u00e9veloppement en fraction continue d'un nombre choisi au hasard', Compositio Math.\n3 (1936), 286\u2013303.","journal-title":"Compositio Math."},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF01299581","volume":"67","author":"G. Lochs","year":"1963","unstructured":"Gustav Lochs, \u2018Die ersten 968 Kettenbruchnenner von \u03c0', Monatsh. Math., 67 (1963), 311\u2013316.","journal-title":"Monatsh. Math."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF02993063","volume":"27","author":"G. Lochs","year":"1964","unstructured":"Gustav Lochs, \u2018Vergleich der Genauichkeit von Dezimalbruch und Kettenbruch', Abh. Math. Seminar Hamburg, 27 (1964), 142\u2013144.","journal-title":"Abh. Math. Seminar Hamburg"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0747-7171(87)80059-7","volume":"4","author":"A. Peth\u00f3","year":"1987","unstructured":"Attila Peth\u00f3, \u2018On the resolution of Thue inequalities', J. Symb. Comp.\n4 (1987), 103\u2013109.","journal-title":"J. Symb. Comp."},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/BF01386297","volume":"4","author":"R. D. Richtmyer","year":"1962","unstructured":"R. D. Richtmyer, Marjorie Devaney and N. Metropolis, \u2018Continued fraction expansionsm of algebraic numbers', Numer. Math.\n4 (1962), 68\u201384.","journal-title":"Numer. Math."},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00289520","volume":"1","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage, \u2018Schnelle Berechnung von Kettenbruchentwicklungen', Acta Informatica\n1 (1971), 139\u2013144","journal-title":"Acta Informatica"},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1090\/S0025-5718-1995-1297479-9","volume":"64","author":"P. Shiu","year":"1995","unstructured":"P. Shiu, \u2018Computation of continued fractions without input values', Math. Comp.\n64 (1995), 1307\u20131317.","journal-title":"Math. Comp."},{"key":"4_CR15","unstructured":"H. M. Stark, \u2018An explanation of some exotic continued fractions found by Brillhart', in Computers in Number Theory, A. O. L. Atkin and B. J. Birch eds., (Academic Press, 1971), 21\u201335."},{"key":"4_CR16","unstructured":"Benjamin M.M. de Weger, Complete solution of a Thue inequality, Technical Report 9561\/B, December 15, 1995, Econometric Institute, Erasmus University Rotterdam."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61581-4_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:34:56Z","timestamp":1619559296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61581-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615811","9783540706328"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61581-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}