{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:57:55Z","timestamp":1773154675910,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf01202355","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T18:10:30Z","timestamp":1108750230000},"page":"363-376","source":"Crossref","is-referenced-by-count":90,"title":["Simultaneous reduction of a lattice basis and its reciprocal basis"],"prefix":"10.1007","volume":"13","author":[{"given":"M.","family":"Seysen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"Sphere packings, lattices and groups","author":"J. H. Conway","year":"1988","unstructured":"J. H. Conway, andN. J. A. Sloane:Sphere packings, lattices and groups, Springer Verlag, New York, 1988."},{"key":"CR2","unstructured":"M. J. Coster, B. A. LaMacchia, A. M. Odlyzko, andC. P. Schnorr: An improved low-density subset sum algorithm, to appear inComputational Complexity."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1090\/S0025-5718-1975-0379386-6","volume":"29","author":"U. Dieter","year":"1975","unstructured":"U. Dieter: How to compute the shortest vector in a lattice,Math. Comp. 29 (1975), 827?833.","journal-title":"Math. Comp."},{"key":"CR4","unstructured":"M. Euchner, andC. P. Schnorr: Lattice basis reduction: improved practical algorithms and solving subset sum problems,Proceedings of Fundamentals of Computation Theory, FTC '91, Ed. L. Budach, Springer LNCS529 (1991) 68?85."},{"key":"CR5","volume-title":"Geometry of numbers","author":"P. M. Gruber","year":"1987","unstructured":"P. M. Gruber, andJ. Lekkerkerker:Geometry of numbers, North Holland, Amsterdam, 1987."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1137\/0218059","volume":"18","author":"Johan H\u00e5stad","year":"1989","unstructured":"Johan H\u00e5stad, B. Just, J. C. Lagarias, andC. P. Schnorr, Polynomial time algorithms for finding integer relations among real numbers,SIAM J. Comput. 18 (1989), 859?881.","journal-title":"SIAM J. Comput."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01446883","volume":"287","author":"Johan H\u00e5stad","year":"1990","unstructured":"Johan H\u00e5stad, andJ. C. Lagarias: Simultaneously good bases of a lattice and its reciprocal lattice,Math. Ann. 287 (1990), 163?174.","journal-title":"Math. Ann."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"R. Kannan: Improved algorithms on integer programming and related lattice problems,Proc. 15th Annual ACM Symp. on Theory of Computing (1983), 293?206.","DOI":"10.1145\/800061.808749"},{"key":"CR9","unstructured":"D. E. Knuth:The art of computer programming, Vol. 2: Seminumerical algorithms, 2nd edition, Addison-Wesley, 1981."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/BF01442795","volume":"6","author":"A. Korkine","year":"1873","unstructured":"A. Korkine, andG. Zolotarev: Sur les formes quadratiques,Math. Ann. 6 (1873), 366?389.","journal-title":"Math. Ann."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02128669","volume":"10","author":"J. C. Lagarias","year":"1990","unstructured":"J. C. Lagarias, H. W. Lenstra, Jr., andC. P. Schnorr: Korkine Zolotarev bases and successive minima of a lattice and its reciprocal,Combinatorica 10 (1990), 333?348.","journal-title":"Combinatorica"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J. C. Lagarias","year":"1985","unstructured":"J. C. Lagarias, andA. M. Odlyzko: Solving low-density subset sum problems,J. Assoc. Comp. Mach. 32 (1985), 229?246.","journal-title":"J. Assoc. Comp. Mach."},{"key":"CR13","unstructured":"B. A. LaMacchia: Basis reduction algorithms and subset sum problems. Thesis for the degree of Master of Science, Department of Electrical engineering and Computer Science, Massachusetts Institute mof Technology, May 1991."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr., andL. Lov\u00e1sz: Factoring polynomials with rational coefficients,Math. Ann. 261 (1982), 515?534.","journal-title":"Math. Ann."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. W. Lenstra Jr.","year":"1983","unstructured":"H. W. Lenstra, Jr.: Integer programming with a fixed number of variables,Math. Oper. Res. 8 (1983), 538?548.","journal-title":"Math. Oper. Res."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C. P. Schnorr","year":"1987","unstructured":"C. P. Schnorr: A hierarchy of polynomial time lattice basis reduction algorithms,Theor. Comp. Sci. 53 (1987), 201?227.","journal-title":"Theor. Comp. Sci."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0196-6774(88)90004-1","volume":"9","author":"C. P. Schnorr","year":"1988","unstructured":"C. P. Schnorr: A more efficient algorithm for lattice basis reduction,J. Algorithms 9 (1988), 47?62.","journal-title":"J. Algorithms"},{"key":"CR18","unstructured":"C. P. Schnorr: Factoring integers and computing discrete logarithms via diophantine approximation,Proceedings of Eurocrypt '91, Brighton, May 1991, to appear in Springer LNCS."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202355.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202355\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:01:50Z","timestamp":1556730110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF01202355"],"URL":"https:\/\/doi.org\/10.1007\/bf01202355","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}