3 citations · 4 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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…
cs.DS2009★ 1 cited
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…