{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:53:43Z","timestamp":1776297223185,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0020-0190(00)00186-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:42:39Z","timestamp":1027644159000},"page":"121-126","source":"Crossref","is-referenced-by-count":8,"title":["Short vectors of planar lattices via continued fractions"],"prefix":"10.1016","volume":"79","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00186-1_BIB001","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0020-0190(00)00186-1_BIB002","series-title":"Efficient Algorithms","volume":"1","author":"Bach","year":"1996"},{"key":"10.1016\/S0020-0190(00)00186-1_BIB003","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579200","article-title":"An application of simultaneous Diophantine approximation in combinatorial optimization","volume":"7","author":"Frank","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(00)00186-1_BIB004","series-title":"Disquisitiones Arithmeticae","author":"Gauss","year":"1801"},{"key":"10.1016\/S0020-0190(00)00186-1_BIB005","series-title":"Geometric Algorithms and Combinatorial Optimization","volume":"2","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/S0020-0190(00)00186-1_BIB006","series-title":"Continued Fractions","author":"Khintchine","year":"1963"},{"key":"10.1016\/S0020-0190(00)00186-1_BIB007","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\/S0020-0190(00)00186-1_BIB008","series-title":"Handbook of Theoretical Computer Science, Vol. A","article-title":"Algorithms in number theory","author":"Lenstra","year":"1990"},{"key":"10.1016\/S0020-0190(00)00186-1_BIB009","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann."},{"issue":"4","key":"10.1016\/S0020-0190(00)00186-1_BIB010","doi-asserted-by":"crossref","first-page":"538","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\/S0020-0190(00)00186-1_BIB011","series-title":"Die Lehre von den Kettenbr\u00fcchen","author":"Perron","year":"1954"},{"issue":"1\u20132","key":"10.1016\/S0020-0190(00)00186-1_BIB012","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0304-3975(96)00185-5","article-title":"Finding a shortest vector in a two-dimensional lattice modulo m","volume":"172","author":"Rote","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00186-1_BIB013","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00289520","article-title":"Schnelle Berechnung von Kettenbruchentwicklungen (Speedy computation of expansions of continued fractions)","volume":"1","author":"Sch\u00f6nhage","year":"1971","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(00)00186-1_BIB014","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC 91","first-page":"128","article-title":"Fast reduction and composition of binary quadratic forms","author":"Sch\u00f6nhage","year":"1991"},{"key":"10.1016\/S0020-0190(00)00186-1_BIB015","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0020-0190(00)00186-1_BIB016","series-title":"Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA","first-page":"437","article-title":"Fast unimodular reduction: Planar integer lattices","author":"Yap","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001861?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001861?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T15:28:01Z","timestamp":1555428481000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0020019000001861"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00186-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}