{"date_created":"2018-06-05T08:07:24Z","issue":"18","year":"2009","department":[{"_id":"64"}],"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"first_name":"Stefanie","last_name":" Naewe","full_name":" Naewe, Stefanie","id":"1971"}],"intvolume":"       410","citation":{"ieee":"J. Blömer and S.  Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” <i>Theoretical Computer Science</i>, vol. 410, no. 18, pp. 1648–1665, 2009, doi: <a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>.","short":"J. Blömer, S.  Naewe, Theoretical Computer Science 410 (2009) 1648–1665.","ama":"Blömer J,  Naewe S. Sampling methods for shortest vectors, closest vectors and successive minima. <i>Theoretical Computer Science</i>. 2009;410(18):1648-1665. doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>","bibtex":"@article{Blömer_ Naewe_2009, title={Sampling methods for shortest vectors, closest vectors and successive minima}, volume={410}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>}, number={18}, journal={Theoretical Computer Science}, author={Blömer, Johannes and  Naewe, Stefanie}, year={2009}, pages={1648–1665} }","chicago":"Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i> 410, no. 18 (2009): 1648–65. <a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">https://doi.org/10.1016/j.tcs.2008.12.045</a>.","mla":"Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i>, vol. 410, no. 18, 2009, pp. 1648–65, doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>.","apa":"Blömer, J., &#38;  Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. <i>Theoretical Computer Science</i>, <i>410</i>(18), 1648–1665. <a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">https://doi.org/10.1016/j.tcs.2008.12.045</a>"},"volume":410,"language":[{"iso":"eng"}],"page":"1648 - 1665","publication_status":"published","type":"journal_article","user_id":"49063","keyword":["Geometry of numbers","Lattices","Shortest vectors"],"status":"public","title":"Sampling methods for shortest vectors, closest vectors and successive minima","publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2008.12.045","date_updated":"2024-08-08T12:18:04Z","_id":"2999","publication_identifier":{"issn":["0304-3975"]}}