3 citations · 4 across the 4 of their papers we have counts for
4 papers
Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms
Daniel Dadush, Santosh Vempala
We give a deterministic O(log n)^n algorithm for the {\em Shortest Vector Problem (SVP)} of a lattice under {\em any} norm, improving on the previous best deterministic bound of n^…
On the Chvatal-Gomory Closure of a Compact Convex Set
Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
In this paper, we show that the Chvatal-Gomory closure of a compact convex set is a rational polytope. This resolves an open question discussed in Schrijver [Schrijver 80'] and gen…
Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid Coverings
Daniel Dadush, Chris Peikert, Santosh Vempala
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Pr…
Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a give…