Publications (24)
Lattice-based Locality Sensitive Hashing is Optimal
Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota +1
Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala
Towards Strong Reverse Minkowski-type Inequalities for Lattices
Daniel Dadush, Oded Regev
On the Chvatal-Gomory Closure of a Compact Convex Set
Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
Rescaling Algorithms for Linear Conic Feasibility
Daniel Dadush, László A. Végh, Giacomo Zambelli
Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms
Daniel Dadush, Santosh Vempala
AWGN-Goodness is Enough: Capacity-Achieving Lattice Codes based on Dithered Probabilistic Shaping
Antonio Campello, Daniel Dadush, Cong Ling
Solving the Closest Vector Problem in $2^n$ Time--- The Discrete Gaussian Strikes Again!
Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz
An Algorithm for Komlós Conjecture Matching Banaszczyk's bound
Nikhil Bansal, Daniel Dadush, Shashwat Garg
Near-Optimal Deterministic Algorithms for Volume Computation and Lattice Problems via M-Ellipsoids
Daniel Dadush, Santosh Vempala
On the Shadow Simplex Method for Curved Polyhedra
Daniel Dadush, Nicolai Hähnle
The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues
Nikhil Bansal, Daniel Dadush, Shashwat Garg +1
Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid Coverings
Daniel Dadush, Chris Peikert, Santosh Vempala
A Friendly Smoothed Analysis of the Simplex Method
Daniel Dadush, Sophie Huiberts
Lattice Sparsification and the Approximate Closest Vector Problem
Daniel Dadush, Gabor Kun
A Deterministic Polynomial Space Construction for eps-nets under any Norm
Daniel Dadush
On the Closest Vector Problem with a Distance Guarantee
Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem
Daniel Dadush, Shashwat Garg, Shachar Lovett +1
On the Lattice Smoothing Parameter Problem
Kai-Min Chung, Daniel Dadush, Feng-Hao Liu +1
Short Paths on the Voronoi Graph and the Closest Vector Problem with Preprocessing
Nicolas Bonifas, Daniel Dadush
On the existence of 0/1 polytopes with high semidefinite extension complexity
Jop Briët, Daniel Dadush, Sebastian Pokutta
A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming
Daniel Dadush
Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling
Divesh Aggarwal, Daniel Dadush, Oded Regev +1
On the Lattice Distortion Problem
Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz