{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T21:26:44Z","timestamp":1696368404394},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0304-3975(96)00185-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"303-308","source":"Crossref","is-referenced-by-count":13,"title":["Finding a shortest vector in a two-dimensional lattice modulo m"],"prefix":"10.1016","volume":"172","author":[{"given":"G\u00fcnter","family":"Rote","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00185-5_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(96)00185-5_BIB2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","article-title":"Improved methods for calculating vectors of short length in a lattice, including a complexity analysis","volume":"44","author":"Fincke","year":"1985","journal-title":"Math. Comput."},{"key":"10.1016\/S0304-3975(96)00185-5_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(85)90067-2","article-title":"Algorithms to construct Minkowski and Hermite reduced bases","volume":"41","author":"Helfrich","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00185-5_BIB4","series-title":"Introduction to Number Theory","author":"Hua","year":"1982"},{"key":"10.1016\/S0304-3975(96)00185-5_BIB5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","article-title":"Minkowski's convex body theorem and integer programming","volume":"12","author":"Kannan","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(96)00185-5_BIB6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0304-3975(92)00021-I","article-title":"An algorithm for finding a shortest vector in a two-dimensional modular lattice","volume":"125","author":"Lempel","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00185-5_BIB7","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 Inform."},{"key":"10.1016\/S0304-3975(96)00185-5_BIB8","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/0209036","article-title":"Storage modification machines","volume":"9","author":"Sch\u00f6nhage","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00185-5_BIB9_1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1051\/ita\/1989230303451","article-title":"La r\u00e9duction des r\u00e9seaux. Autour de l'algorithme de Lenstra, Lenstra, Lov\u00e1sz","volume":"23","author":"Vall\u00e9e","year":"1989","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0304-3975(96)00185-5_BIB9_2","first-page":"95","article-title":"A central problem in the algorithmic geometry of numbers: lattice reduction. Around the algorithm of Lenstra, Lov\u00e1sz, Lov\u00e1sz","volume":"3","author":"Vall\u00e9e","year":"1990","journal-title":"CWI Quart."},{"key":"10.1016\/S0304-3975(96)00185-5_BIB10","series-title":"Proc. 33rd Annu. IEEE Symp. Found. Comput. Sci. (FOCS)","first-page":"437","article-title":"Fast unimodular reduction: planar integer lattices","author":"Yap","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001855?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001855?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:56:28Z","timestamp":1555390588000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596001855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0304397596001855"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00185-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}