{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T12:28:28Z","timestamp":1586867308467},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642022944","type":"print"},{"value":"9783642022951","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02295-1_1","type":"book-chapter","created":{"date-parts":[[2009,11,18]],"date-time":"2009-11-18T13:20:09Z","timestamp":1258550409000},"page":"1-17","source":"Crossref","is-referenced-by-count":1,"title":["The History of the LLL-Algorithm"],"prefix":"10.1007","author":[{"given":"Ionica","family":"Smeets","sequence":"first","affiliation":[]},{"given":"Arjen","family":"Lenstra","sequence":"additional","affiliation":[]},{"given":"Hendrik","family":"Lenstra","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Lov\u00e1sz","sequence":"additional","affiliation":[]},{"given":"Peter","family":"van Emde Boas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,7]]},"reference":[{"issue":"2","key":"1_CR1_1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2): 169\u2013197, 1981.","journal-title":"Combinatorica"},{"issue":"5","key":"1_CR2_1","first-page":"1093","volume":"244","author":"LG Ha\u010dijan","year":"1979","unstructured":"L. G. Ha\u010dijan. A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR, 244(5): 1093\u20131096, 1979.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"1_CR3_1","unstructured":"H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Report 81-03 (First version), University of Amsterdam, April 1981."},{"key":"1_CR4_1","unstructured":"H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Report 81-03 (Second version), University of Amsterdam, November 1981."},{"issue":"4","key":"1_CR5_1","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Math. Oper. Res., 8(4): 538\u2013548, 1983.","journal-title":"Math. Oper. Res."},{"key":"1_CR6_1","unstructured":"H. W. Lenstra, Jr. Euclidean number fields of large degree. Report 76-09, University of Amsterdam, May 1976."},{"key":"1_CR7_1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120921","volume":"14","author":"P G\u00e1cs","year":"1981","unstructured":"P. G\u00e1cs, and L. Lov\u00e1sz. Khachiyan\u2019s algorithm for linear programming. Math. Programming Stud., 14: 61\u201368, 1981.","journal-title":"Math. Programming Stud."},{"issue":"4","key":"1_CR8_1","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr., and L. Lov\u00e1sz. Factoring polynomials with rational coefficients. Math. Ann., 261(4): 515\u2013534, 1982.","journal-title":"Math. Ann."},{"issue":"4","key":"1_CR9_1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/355705.355709","volume":"2","author":"PJ Weinberger","year":"1976","unstructured":"P. J. Weinberger and L. P. Rothschild. Factoring polynomials over algebraic number fields. ACM Trans. Math. Software, 2(4): 335\u2013350, 1976.","journal-title":"ACM Trans. Math. Software"},{"key":"1_CR10_1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0022-314X(69)90047-X","volume":"1","author":"H. Zassenhaus","year":"1969","unstructured":"H. Zassenhaus. On Hensel factorization. I. J. Number Theory, 1: 291\u2013311, 1969.","journal-title":"J. Number Theory"}],"container-title":["The LLL Algorithm","Information Security and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02295-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T16:35:01Z","timestamp":1552235701000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022944","9783642022951"],"references-count":10,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-02295-1_1","relation":{"cites":[]},"ISSN":["1619-7100"],"issn-type":[{"value":"1619-7100","type":"print"}]}}