Obserwuj
Daniel Dadush
Tytuł
Cytowane przez
Cytowane przez
Rok
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
2132015
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
1292011
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
1012015
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
812018
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
792019
Integer programming, lattice algorithms, and deterministic volume estimation
DN Dadush
Georgia Institute of Technology, 2012
782012
A friendly smoothed analysis of the simplex method
D Dadush, S Huiberts
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
702018
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
632014
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
612012
The split closure of a strictly convex body
D Dadush, SS Dey, JP Vielma
Operations Research Letters 39 (2), 121-126, 2011
602011
On the existence of 0/1 polytopes with high semidefinite extension complexity
J Briët, D Dadush, S Pokutta
Mathematical Programming 153, 179-199, 2015
432015
On the lattice smoothing parameter problem
KM Chung, D Dadush, FH Liu, C Peikert
2013 IEEE Conference on Computational Complexity, 230-241, 2013
362013
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
D Dadush, S Huiberts, B Natura, LA Végh
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
352020
On the shadow simplex method for curved polyhedra
D Dadush, N Hähnle
Discrete & Computational Geometry 56, 882-909, 2016
352016
On the complexity of branching proofs
D Dadush, S Tiwari
arXiv preprint arXiv:2006.04124, 2020
342020
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
292014
Geometric rescaling algorithms for submodular function minimization
D Dadush, LA Végh, G Zambelli
Mathematics of Operations Research 46 (3), 1081-1108, 2021
282021
Near-optimal deterministic algorithms for volume computation via M-ellipsoids
D Dadush, SS Vempala
Proceedings of the National Academy of Sciences 110 (48), 19237-19245, 2013
282013
On the Chvátal–Gomory closure of a compact convex set
D Dadush, SS Dey, JP Vielma
Mathematical Programming 145, 327-348, 2014
272014
Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers
D Dadush, B Natura, LA Végh
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
262020
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20