关注
Daniel Dadush
Daniel Dadush
在 cwi.nl 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
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
1962015
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
1222011
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
932015
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
752018
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
732019
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
662018
Integer programming, lattice algorithms, and deterministic volume estimation
DN Dadush
Georgia Institute of Technology, 2012
602012
The split closure of a strictly convex body
D Dadush, SS Dey, JP Vielma
Operations Research Letters 39 (2), 121-126, 2011
592011
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
582012
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
552014
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
On the complexity of branching proofs
D Dadush, S Tiwari
arXiv preprint arXiv:2006.04124, 2020
332020
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
302020
On the shadow simplex method for curved polyhedra
D Dadush, N Hähnle
Discrete & Computational Geometry 56, 882-909, 2016
292016
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
282014
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
Geometric rescaling algorithms for submodular function minimization
D Dadush, LA Végh, G Zambelli
Mathematics of Operations Research 46 (3), 1081-1108, 2021
262021
On the Chvátal–Gomory closure of a compact convex set
D Dadush, SS Dey, JP Vielma
Mathematical Programming 145, 327-348, 2014
262014
Towards strong reverse Minkowski-type inequalities for lattices
D Dadush, O Regev
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
252016
系统目前无法执行此操作,请稍后再试。
文章 1–20