Daniel Dadush
Title
Cited by
Cited by
Year
Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling
D Aggarwal, D Dadush, O Regev, N Stephens-Davidowitz
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1212015
Enumerative lattice algorithms in any norm via M-ellipsoid coverings
D Dadush, C Peikert, S Vempala
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 580-589, 2011
962011
Solving the Closest Vector Problem in 2^ n Time--The Discrete Gaussian Strikes Again!
D Aggarwal, D Dadush, N Stephens-Davidowitz
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 563-582, 2015
642015
The split closure of a strictly convex body
D Dadush, SS Dey, JP Vielma
Operations Research Letters 39 (2), 121-126, 2011
582011
On the closest vector problem with a distance guarantee
D Dadush, O Regev, N Stephens-Davidowitz
2014 IEEE 29th Conference on Computational Complexity (CCC), 98-109, 2014
442014
On the closest vector problem with a distance guarantee
D Dadush, O Regev, N Stephens-Davidowitz
2014 IEEE 29th Conference on Computational Complexity (CCC), 98-109, 2014
442014
On the existence of 0/1 polytopes with high semidefinite extension complexity
J Briët, D Dadush, S Pokutta
Mathematical Programming 153 (1), 179-199, 2015
422015
Unconditional differentially private mechanisms for linear queries
A Bhaskara, D Dadush, R Krishnaswamy, K Talwar
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
412012
An algorithm for Komlós conjecture matching Banaszczyk's bound
N Bansal, D Dadush, S Garg
SIAM Journal on Computing 48 (2), 534-553, 2019
372019
The Gram-Schmidt walk: a cure for the Banaszczyk blues
N Bansal, D Dadush, S Garg, S Lovett
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
322018
Integer programming, lattice algorithms, and deterministic volume estimation
DN Dadush
Georgia Institute of Technology, 2012
312012
The Chvátal-Gomory closure of a strictly convex body
D Dadush, SS Dey, JP Vielma
Mathematics of Operations Research 36 (2), 227-239, 2011
252011
A friendly smoothed analysis of the simplex method
D Dadush, S Huiberts
SIAM Journal on Computing 49 (5), STOC18-449-STOC18-499, 2019
242019
On the Chvátal–Gomory closure of a compact convex set
D Dadush, SS Dey, JP Vielma
Mathematical Programming 145 (1), 327-348, 2014
242014
On the lattice smoothing parameter problem
KM Chung, D Dadush, FH Liu, C Peikert
2013 IEEE Conference on Computational Complexity, 230-241, 2013
222013
Lattice sparsification and the approximate closest vector problem
D Dadush, G Kun
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
202013
Lattice sparsification and the approximate closest vector problem
D Dadush, G Kun
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
202013
Short paths on the Voronoi graph and closest vector problem with preprocessing
D Dadush, N Bonifas
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
192014
Short paths on the Voronoi graph and closest vector problem with preprocessing
D Dadush, N Bonifas
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
192014
On the Chvátal-Gomory closure of a compact convex set
D Dadush, SS Dey, JP Vielma
International Conference on Integer Programming and Combinatorial …, 2011
192011
The system can't perform the operation now. Try again later.
Articles 1–20