3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CC2011★ 3 cited
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^…
math.OC2010
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…
cs.DS2010
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…