{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:34:38Z","timestamp":1776828878074,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540159841","type":"print"},{"value":"9783540396857","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15984-3_278","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:29:28Z","timestamp":1330176568000},"page":"279-288","source":"Crossref","is-referenced-by-count":3,"title":["Arithmetic in quadratic fields with unique factorization"],"prefix":"10.1007","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinrich","family":"Rolletschek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02392288","volume":"87","author":"E.S. Barnes","year":"1952","unstructured":"Barnes, E.S., and Swinnerton-Dyer, H.P.F.: The homogeneous minima of binary quadratic forms. Acta Math. 87, 255\u2013323 (1952).","journal-title":"Acta Math."},{"key":"50_CR2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4153\/CJM-1951-042-6","volume":"3","author":"A. Brauer","year":"1951","unstructured":"Brauer, A., and Reynolds, R.L.: On a theorem of Aubry-Thue. Canadian J. Math. 3, 367\u2013374 (1951).","journal-title":"Canadian J. Math."},{"key":"50_CR3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.4153\/CJM-1950-026-7","volume":"2","author":"H. Chatland","year":"1950","unstructured":"Chatland, H., and Davenport, H.: Euclid's algorithm in real quadratic fields. Canadian J. Math. 2, 289\u2013296 (1950).","journal-title":"Canadian J. Math."},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Caviness, B.F., and Collins, G.E.: Algorithms for Gaussian integer arithmetic. Proc. 1976 ACM Symp. Symbolic Algebraic Computation, 36\u201345.","DOI":"10.1145\/800205.806321"},{"key":"50_CR5","unstructured":"Hardy, G.H., and Wright, E.M.: An Introduction to the Theory of Numbers. Oxford Univ. Press 1979."},{"key":"50_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-52795-1","volume-title":"Vorlesung \u00fcber die Zahlentheorie","author":"H. Hasse","year":"1950","unstructured":"Hasse, H.: Vorlesung \u00fcber die Zahlentheorie. Springer Verlag, Berlin 1950."},{"key":"50_CR7","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/3-540-12868-9_107","volume":"162","author":"E. Kaltofen","year":"1983","unstructured":"Kaltofen, E.: On the complexity of finding short vectors in integer lattices. Springer Lec. Notes Comp. Sci. 162, 236\u2013244 (1983).","journal-title":"Springer Lec. Notes Comp. Sci."},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. Proc. 15th ACM Symp. Theory Comp., 193\u2013206 (1983).","DOI":"10.1145\/800061.808749"},{"key":"50_CR9","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1979","unstructured":"Kannan, R., and Bachem, A.: Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Comp. 8, 499\u2013507 (1979).","journal-title":"SIAM J. Comp."},{"key":"50_CR10","volume-title":"The Art of Programming, Vol. 2, Seminumerical Algorithms","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Programming, Vol. 2, Seminumerical Algorithms, 2nd Ed. Reading, MA: Addison Wesley 1981.","edition":"2nd Ed."},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"Lenstra, A. K., Lenstra, H. W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982).","journal-title":"Math. Ann."},{"issue":"33","key":"50_CR12","first-page":"489","volume":"1","author":"T. Nagell","year":"1951","unstructured":"Nagell, T.: Sur un theoreme d'Axel Thue. Arkiv f\u00f6r Matematik 1, 33, 489\u2013496 (1951).","journal-title":"Arkiv f\u00f6r Matematik"},{"key":"50_CR13","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/3-540-12868-9_87","volume":"162","author":"H. Rolletschek","year":"1983","unstructured":"Rolletschek, H.: The Euclidean algorithm for Gaussian integers. Springer Lec. Notes Comp. Sci. 162, 12\u201323 (1983).","journal-title":"Springer Lec. Notes Comp. Sci."},{"key":"50_CR14","unstructured":"Rolletschek, H.: On the number of divisions of the Euclidean algorithm applied to Gaussian integers. Submitted to the Journal of Symbolic Computation."},{"key":"50_CR15","unstructured":"Schnorr, C.P.: A remark on the construction of short lattice elements. Manuscript April 1984."},{"key":"50_CR16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00289520","volume":"1","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A.: Schnelle Berechnung von Kettenbruchentwicklungen. Acta Inf. 1, 139\u2013144 (1971).","journal-title":"Acta Inf."},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A.: Factorization of Univariate Integer Polynomials by Diophantine Approximation and by an Improved Reduction Algorithm. Proc. Internat. Conf. Automata, Lang. and Prog. 1984.","DOI":"10.1007\/3-540-13345-3_40"},{"key":"50_CR18","unstructured":"Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Manuscript 1983."},{"key":"50_CR19","unstructured":"Shanks, D.: Solved and Unsolved Problems in Number Theory I, 2nd Ed. Chelsea Publishers, 1978."},{"key":"50_CR20","first-page":"1","volume":"17","author":"H. Stark","year":"1967","unstructured":"Stark, H.: A complete determination of complex quadratic fields of class number one. Mich. Math. J. 17, 1\u201327 (1967).","journal-title":"Mich. Math. J."},{"key":"50_CR21","unstructured":"Thue, A.: Et par antydninger til en talteoretisk methode. Vid. Selsk. Forhandlinger Christiania 7 (1902), in Norwegian."},{"key":"50_CR22","doi-asserted-by":"crossref","unstructured":"Wang, P.: A p-adic algorithm for univariate partial fractions. Proc. 1981 ACM Symp. Symbolic and Alg. Comp., 212\u2013217.","DOI":"10.1145\/800206.806398"}],"container-title":["Lecture Notes in Computer Science","EUROCAL '85"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15984-3_278.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:00:48Z","timestamp":1619542848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15984-3_278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159841","9783540396857"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-15984-3_278","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985]]}}}