1. Aggarwal, D., Stephens-Davidowitz, N.: Just take the average! An embarrassingly simple $$2^n$$-time algorithm for SVP (and CVP). In: 1st Symposium on Simplicity in Algorithms (SOSA 2018), OpenAccess Series in Informatics (OASIcs), vol. 61, pp. 12:1–12:19. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2018)
2. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of Thirty-Third annual ACM Symposium on Theory of Computing, pp. 601–610. ACM (2001)
3. Ajtai, M., Kumar, R., Sivakumar, D.: Sampling short lattice vectors and the closest lattice vector problem. In: Proceedings of 17th IEEE Annual Conference on Computational Complexity, pp. 53–57. IEEE (2002)
4. Banaszczyk, W.: Inequalities for convex bodies and polar reciprocal lattices in $$\mathbf{R}^n$$. II. Application of $$K$$-convexity. Discrete Comput. Geom. 16(3), 305–311 (1996)
5. Bonifas, N., Dadush, D.: Short paths on the Voronoi graph and closest vector problem with preprocessing. In: Proceedings of Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 295–314. SIAM, Philadelphia (2015)