{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T11:02:16Z","timestamp":1776769336820,"version":"3.51.2"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9816,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1016\/s0747-7171(86)80027-x","type":"journal-article","created":{"date-parts":[[2008,4,18]],"date-time":"2008-04-18T16:16:41Z","timestamp":1208535401000},"page":"261-291","source":"Crossref","is-referenced-by-count":15,"title":["On the Number of Divisions of the Euclidean Algorithm Applied to Gaussian Integers"],"prefix":"10.1016","volume":"2","author":[{"given":"Heinrich","family":"Rolletschek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(86)80027-X_bib1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02392288","article-title":"The homogeneous minima of binary quadratic forms","volume":"87","author":"Barnes","year":"1952","journal-title":"Acta Math."},{"key":"10.1016\/S0747-7171(86)80027-X_bib2","series-title":"Proceedings of the 1976 Symposium on Symbolic and Algebraic Computation","first-page":"36","article-title":"Algorithms for Gaussian integer arithmetic","author":"Caviness","year":"1976"},{"key":"10.1016\/S0747-7171(86)80027-X_bib3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.4153\/CJM-1950-026-7","article-title":"Euclid's algorithm in real quadratic fields","volume":"2","author":"Chatland","year":"1950","journal-title":"Can. J. Math."},{"key":"10.1016\/S0747-7171(86)80027-X_bib4","first-page":"133","article-title":"A weakening of the Euclidian property for integral domains and applications to algebraic number theory. I.","volume":"282","author":"Cooke","year":"1976","journal-title":"J. refine angew. Math."},{"key":"10.1016\/S0747-7171(86)80027-X_bib5","first-page":"41","article-title":"Sur le nombre des divisions \u00e0 effectuer pour obtenir le plus grand common diviseur entre deux nombres entiers","volume":"11","author":"Dupr\u00e9","year":"1846","journal-title":"J. Math. purer appl."},{"key":"10.1016\/S0747-7171(86)80027-X_bib6","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1960"},{"key":"10.1016\/S0747-7171(86)80027-X_bib7","series-title":"Vorlesungen iiber Zahlentheorie","author":"Hasse","year":"1964"},{"key":"10.1016\/S0747-7171(86)80027-X_bib8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02612324","article-title":"Ober die Entwicklung komplexer Gr\u00f6\u03b2en in Kettenbr\u00fcche","volume":"11","author":"Hurwitz","year":"1887","journal-title":"Acta Math."},{"key":"10.1016\/S0747-7171(86)80027-X_bib9","first-page":"279","article-title":"Arithmetic in quadratic fields with unique factorization","volume":"204","author":"Kaltofen","year":"1985"},{"key":"10.1016\/S0747-7171(86)80027-X_bib10","series-title":"Reading","article-title":"The Art of Computer Programming. Vol. 2: Seminumerical Algorithms","author":"Knuth","year":"1981"},{"key":"10.1016\/S0747-7171(86)80027-X_bib11","first-page":"867","article-title":"Note sur la limite du nombre des divisions dans la recherche du plus grand commun diviseur entre deux nombres entiers","volume":"19","author":"Lam\u00e9","year":"1844","journal-title":"Comptes Rendus Acad. Sci. Paris"},{"key":"10.1016\/S0747-7171(86)80027-X_bib12","first-page":"1","article-title":"Le meilleur algorithme d'Euclide pour K[X] et Z","volume":"284","author":"Lazard","year":"1977","journal-title":"Comptes Rendus Acad. Sci. Paris"},{"key":"10.1016\/S0747-7171(86)80027-X_bib13","first-page":"12","article-title":"The Euclidean algorithm for Gaussian integers","volume":"162","author":"Rolletschek","year":"1983"},{"key":"10.1016\/S0747-7171(86)80027-X_bib14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00289520","article-title":"Schnelle berechnung von kettenbruchentwicklungen","volume":"1","author":"Sch\u00f6nhage","year":"1971","journal-title":"Acta Informatica"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074771718680027X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074771718680027X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,29]],"date-time":"2018-12-29T19:26:13Z","timestamp":1546111573000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S074771718680027X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["S074771718680027X"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(86)80027-x","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}