Andrew Novocin, Damien Stehlé, Gilles Villard. An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. In Lance Fortnow, Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. pages 403-412, ACM, 2011. [doi]
@inproceedings{NovocinSV11,
title = {An LLL-reduction algorithm with quasi-linear time complexity: extended abstract},
author = {Andrew Novocin and Damien Stehlé and Gilles Villard},
year = {2011},
doi = {10.1145/1993636.1993691},
url = {http://doi.acm.org/10.1145/1993636.1993691},
researchr = {https://researchr.org/publication/NovocinSV11},
cites = {0},
citedby = {0},
pages = {403-412},
booktitle = {Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011},
editor = {Lance Fortnow and Salil P. Vadhan},
publisher = {ACM},
isbn = {978-1-4503-0691-1},
}