The gram-schmidt walk: a cure for the Banaszczyk blues
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
Chris Peikert
Nikhil Bansal
Santosh Vempala
Shachar Lovett
Shashwat Garg
(Gap/S)ETH hardness of SVP