{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:53:19Z","timestamp":1776844399185,"version":"3.51.2"},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0196-6774(91)90033-u","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:03:10Z","timestamp":1099764190000},"page":"556-572","source":"Crossref","is-referenced-by-count":33,"title":["Gauss' algorithm revisited"],"prefix":"10.1016","volume":"12","author":[{"given":"Brigitte","family":"Vall\u00e9e","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(91)90033-U_BIB1","first-page":"216","volume":"40","author":"Dirichlet","year":"1850","journal-title":"J. Reine Angew Math."},{"key":"10.1016\/0196-6774(91)90033-U_BIB2","first-page":"41","article-title":"Sur le nombre des divisions \u00e0 effectuer pour obtenir le plus grand commun diviseur entre deux nombres entiers","volume":"11","author":"Dupr\u00e9","year":"1846","journal-title":"J. Math."},{"key":"10.1016\/0196-6774(91)90033-U_BIB3","series-title":"French translation of \u201cDisquisitiones Arithmeticae\u201d","article-title":"Recherches arithm\u00e9tiques","author":"Gauss","year":"1953"},{"key":"10.1016\/0196-6774(91)90033-U_BIB4","series-title":"Proceedings, MFCS'89","first-page":"314","article-title":"Integer relations among algebraic numbers","volume":"Vol. 379","author":"Just","year":"1989"},{"key":"10.1016\/0196-6774(91)90033-U_BIB5","series-title":"15th Annual ACM Sympos. Theory of Computing","first-page":"193","article-title":"Improved algorithms for integer programming and related lattice problem","author":"Kannan","year":"1983"},{"issue":"181","key":"10.1016\/0196-6774(91)90033-U_BIB6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-1988-0917831-4","article-title":"Polynomial factorization and bits of algebraic and some transcendental numbers","volume":"50","author":"Kannan","year":"1988","journal-title":"Math. Comput."},{"key":"10.1016\/0196-6774(91)90033-U_BIB7","first-page":"361","volume":"Vol. II","author":"Knuth","year":"1981"},{"key":"10.1016\/0196-6774(91)90033-U_BIB8","series-title":"23rd IEEE Symp. FOCS","article-title":"Computational complexity of simultaneous diophantine approximation problem","author":"Lagarias","year":"1982"},{"key":"10.1016\/0196-6774(91)90033-U_BIB9","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0196-6774(80)90021-8","article-title":"Worst-Case complexity bounds for algorithms in the theory of integral quadratic forms","volume":"1","author":"Lagarias","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(91)90033-U_BIB10","series-title":"24th IEEE Symposium FOCS","first-page":"1","article-title":"Solving low-density subset sum problem","author":"Lagarias","year":"1983"},{"key":"10.1016\/0196-6774(91)90033-U_BIB11","unstructured":"J. B. Lagrange, in \u201cOeuvres III\u201d, pp. 695\u2013795."},{"issue":"No. 1","key":"10.1016\/0196-6774(91)90033-U_BIB12","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0214015","article-title":"Factoring polynomials over algebraic number fields","volume":"14","author":"Landau","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(91)90033-U_BIB13","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann."},{"issue":"No. 4","key":"10.1016\/0196-6774(91)90033-U_BIB14","doi-asserted-by":"crossref","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0196-6774(91)90033-U_BIB15","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1867-6","article-title":"From Fermat to Minkowski, Lectures on the Theory of Numbers and Its Historical Development","author":"Scharlau","year":"1985"},{"key":"10.1016\/0196-6774(91)90033-U_BIB16","article-title":"Une approche g\u00e9om\u00e9trique de la r\u00e9duction des r\u00e9seaux en petite dimension","author":"Vall\u00e9e","year":"1986"},{"key":"10.1016\/0196-6774(91)90033-U_BIB17","series-title":"Proceedings of AAECC-6, Roma, 1988","first-page":"427","article-title":"How to guess lth roots modulo n by reducing lattice bases","volume":"Vol. 357","author":"Vall\u00e9e","year":"1988"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190033U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190033U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T08:57:24Z","timestamp":1549097844000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749190033U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["019667749190033U"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90033-u","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}