Daniel Dadush, Daniele Micciancio. Algorithms for the Densest Sub-Lattice Problem. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 1103-1122, SIAM, 2013. [doi]
@inproceedings{DadushM13, title = {Algorithms for the Densest Sub-Lattice Problem}, author = {Daniel Dadush and Daniele Micciancio}, year = {2013}, url = {http://knowledgecenter.siam.org/0236-000060/}, researchr = {https://researchr.org/publication/DadushM13}, cites = {0}, citedby = {0}, pages = {1103-1122}, booktitle = {Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013}, editor = {Sanjeev Khanna}, publisher = {SIAM}, }