{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:08Z","timestamp":1750221008683,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS KAKENHI","award":["16H02780"],"award-info":[{"award-number":["16H02780"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,8]]},"DOI":"10.1145\/3326229.3326265","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"275-282","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Computing a Lattice Basis Revisited"],"prefix":"10.1145","author":[{"given":"Jianwei","family":"Li","sequence":"first","affiliation":[{"name":"CQT, NUS, Singapore &amp; KLMM, AMSS, CAS, SINGAPORE, Singapore"}]},{"given":"Phong Q.","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Inria Paris, France &amp; CNRS, JFLI, University of Tokyo, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0628"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/578775"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646658.700556"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796377"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/206777"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(87)90088-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374408"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220067"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033069"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3328"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218046"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208040"},{"key":"e_1_3_2_1_18_1","volume-title":"Cambridge Tracts in Mathematics","author":"Kitaoka Y.","year":"1993","unstructured":"Y. Kitaoka. Arithmetic of Quadratic Forms. Cambridge Tracts in Mathematics. Cambridge University Press, 1993."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_20_1","volume-title":"Approximating the densest sublattice from Rankin's inequality. LMS Journal of Computation and Mathematics, 17(Special Issue A):92--111","author":"Li J.","year":"2014","unstructured":"J. Li and P. Q. Nguyen. Approximating the densest sublattice from Rankin's inequality. LMS Journal of Computation and Mathematics, 17(Special Issue A):92--111, 2014. Contributed to ANTS-XI, 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326229.3326265"},{"key":"e_1_3_2_1_22_1","first-page":"173","article-title":"Primitive sets in a lattice","volume":"40","author":"Magliveras S. S.","year":"2008","unstructured":"S. S. Magliveras, T. van Trung, and W. Wei. Primitive sets in a lattice. Australasian Journal of Combinatorics, 40:173--186, 2008.","journal-title":"Australasian Journal of Combinatorics"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"J. Martinet. Perfect Lattices in Euclidean Spaces. Springer 2002.","DOI":"10.1007\/978-3-662-05167-2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnt.2011.06.010"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/560443"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930917"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1721900"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993691"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(87)80061-5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2796561.2796598"},{"key":"e_1_3_2_1_31_1","volume-title":"Computational geometry of positive definite quadratic forms: Polyhedral reduction theories, algorithms, and applications","author":"Sch\u00fcrmann A.","year":"2009","unstructured":"A. Sch\u00fcrmann. Computational geometry of positive definite quadratic forms: Polyhedral reduction theories, algorithms, and applications. American Mathematical Society, 2009."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-08287-4"},{"key":"e_1_3_2_1_33_1","volume-title":"ETH Z\u00fcrich","author":"Storjohann A.","year":"1996","unstructured":"A. Storjohann. Faster algorithms for integer lattice basis reduction. Technical report 249, Department of Computer Science, ETH Z\u00fcrich, Switzerland, 1996."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/220346.220362"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/236869.237083"}],"event":{"name":"ISSAC '19: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Beijing China","acronym":"ISSAC '19"},"container-title":["Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326265","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:59Z","timestamp":1750206359000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":35,"alternative-id":["10.1145\/3326229.3326265","10.1145\/3326229"],"URL":"https:\/\/doi.org\/10.1145\/3326229.3326265","relation":{},"subject":[],"published":{"date-parts":[[2019,7,8]]},"assertion":[{"value":"2019-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}