{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:46Z","timestamp":1725544786422},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_8","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"30-42","source":"Crossref","is-referenced-by-count":2,"title":["A New GCD Algorithm for Quadratic Number Rings with Unique Factorization"],"prefix":"10.1007","author":[{"given":"Saurabh","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gudmund Skovbjerg","family":"Frandsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-24847-7_4","volume-title":"Algorithmic Number Theory","author":"S. Agarwal","year":"2004","unstructured":"Agarwal, S., Frandsen, G.: Binary GCD like algorithms in some complex quadratic rings. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 57\u201371. Springer, Heidelberg (2004)"},{"key":"8_CR2","unstructured":"Buchmann, J., Biehl, I.: An analysis of the reduction algorithms for binary quadratic forms. In: Voronoi\u2019s impact on Modern Science, pp. 71\u201398 (1998)"},{"key":"#cr-split#-8_CR3.1","unstructured":"Buchmann, J., Thiel, C., Williams, H.: Short representation of quadratic integers. In: Computational algebra and number theory, Sydney (1992);"},{"key":"#cr-split#-8_CR3.2","unstructured":"Math. Appl., vol. 325, pp. 159???185. Kluwer Acad. Publ., Dordrecht (1995)"},{"key":"#cr-split#-8_CR4.1","unstructured":"Cohn, H.: Advanced number theory. Dover Publications Inc., New York (1980);"},{"key":"#cr-split#-8_CR4.2","unstructured":"Reprint of A second course in number theory, Dover Books on Advanced Mathematics (1962)"},{"issue":"6","key":"8_CR5","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.jsc.2004.02.006","volume":"39","author":"I.B. Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I.B., Frandsen, G.S.: Efficient algorithms for gcd and cubic residuosity in the ring of Eisenstein integers. J. Symb. Comput.\u00a039(6), 643\u2013652 (2005)","journal-title":"J. Symb. Comput."},{"key":"8_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6101-8","volume-title":"Algebra","author":"T.W. Hungerford","year":"1980","unstructured":"Hungerford, T.W.: Algebra. Graduate Texts in Mathematics, vol.\u00a073. Springer, New York (1980); Reprint of the 1974 original"},{"key":"8_CR7","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2103-4","volume-title":"A classical introduction to modern number theory","author":"K. Ireland","year":"1990","unstructured":"Ireland, K., Rosen, M.: A classical introduction to modern number theory, 2nd edn. Graduate Texts in Mathematics, vol.\u00a084. Springer-Verlag, New York (1990)","edition":"2"},{"issue":"188","key":"8_CR8","first-page":"697","volume":"53","author":"E. Kaltofen","year":"1989","unstructured":"Kaltofen, E., Rolletschek, H.: Computing greatest common divisors and factorizations in quadratic number fields. Math. Comp.\u00a053(188), 697\u2013720 (1989)","journal-title":"Math. Comp."},{"key":"8_CR9","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The art of computer programming, 2nd edn., vol.\u00a02. Addison-Wesley Publishing Co., Reading (1981)","edition":"2"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0196-6774(80)90021-8","volume":"1","author":"J.C. Lagarias","year":"1980","unstructured":"Lagarias, J.C.: Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. J. Algorithms\u00a01(2), 142\u2013186 (1980)","journal-title":"J. Algorithms"},{"key":"8_CR11","volume-title":"Algebra","author":"S. Lang","year":"1993","unstructured":"Lang, S.: Algebra, 3rd edn. Addison-Wesley Publishing Company, Reading (1993)","edition":"3"},{"key":"8_CR12","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. American Mathematical Monthly\u00a045, 227\u2013233 (1938)","journal-title":"American Mathematical Monthly"},{"issue":"5","key":"8_CR13","first-page":"385","volume":"13","author":"F. Lemmermeyer","year":"1995","unstructured":"Lemmermeyer, F.: The Euclidean algorithm in algebraic number fields. Exposition. Math.\u00a013(5), 385\u2013416 (1995); Updated version (February 2004), \n                    \n                      http:\/\/www.fen.bilkent.edu.tr\/~franz\/publ\/survey.pdf","journal-title":"Exposition. Math."},{"key":"8_CR14","series-title":"London Math. Soc. Lecture Note Ser","first-page":"123","volume-title":"Number theory days, 1980 (Exeter, 1980)","author":"H.W. Lenstra Jr.","year":"1982","unstructured":"Lenstra Jr., H.W.: On the calculation of regulators and class numbers of quadratic fields. In: Number theory days, 1980 (Exeter, 1980). London Math. Soc. Lecture Note Ser., vol.\u00a056, pp. 123\u2013150. Cambridge Univ. Press, Cambridge (1982)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00289520","volume":"1","author":"A. Schonhage","year":"1971","unstructured":"Schonhage, A.: Schnelle berechnung von kettenbruchentwicklungen. Acta Informatica\u00a01, 139\u2013144 (1971)","journal-title":"Acta Informatica"},{"key":"8_CR16","first-page":"281","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen)\u00a07, 281\u2013292 (1971)","journal-title":"Computing (Arch. Elektron. Rechnen)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/120694.120711","volume-title":"ISSAC 1991: Proceedings of the 1991 international symposium on Symbolic and algebraic computation","author":"A. Sch\u00f6nhage","year":"1991","unstructured":"Sch\u00f6nhage, A.: Fast reduction and composition of binary quadratic forms. In: ISSAC 1991: Proceedings of the 1991 international symposium on Symbolic and algebraic computation, pp. 128\u2013133. ACM Press, New York (1991)"},{"key":"8_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139165464","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V. Shoup","year":"2005","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2005)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Stein, J.: Computational problems associated with Racah algebra. J. Comput. Phys.\u00a0(1), 397\u2013405 (1967)","DOI":"10.1016\/0021-9991(67)90047-2"},{"issue":"5","key":"8_CR20","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1006\/jsco.2000.0422","volume":"30","author":"A. Weilert","year":"2000","unstructured":"Weilert, A.: (1+ i)-ary GCD computation in Z[i] as an analogue to the binary GCD algorithm. J. Symbolic Comput.\u00a030(5), 605\u2013617 (2000)","journal-title":"J. Symbolic Comput."},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/10722028_40","volume-title":"Algorithmic Number Theory","author":"A. Weilert","year":"2000","unstructured":"Weilert, A.: Asymptotically fast GCD computation in Z[i]. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 595\u2013613. Springer, Heidelberg (2000)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1007\/11523468_96","volume-title":"Automata, Languages and Programming","author":"D. Wikstr\u00f6m","year":"2005","unstructured":"Wikstr\u00f6m, D.: On the l-ary gcd-algorithm in rings of integers. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1189\u20131201. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T07:21:35Z","timestamp":1552375295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11682462_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}