D. Dadush

Most-cited papers

Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
D. Dadush, Chris Peikert, S. Vempala
2010IEEE Annual Symposium on Foundations of Computer Science109 citations
Semantic Scholar
The Gram-Schmidt walk: a cure for the Banaszczyk blues
N. Bansal, D. Dadush, S. Garg, Shachar Lovett
2017Symposium on the Theory of Computing94 citations Open access
Semantic Scholar
Solving the Closest Vector Problem in $2^n$ Time - The Discrete Gaussian Strikes Again!
Divesh Aggarwal, D. Dadush, N. Stephens-Davidowitz
2015arXiv.org90 citations
Semantic Scholar
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound
N. Bansal, D. Dadush, S. Garg
2016IEEE Annual Symposium on Foundations of Computer Science80 citations Open access
Semantic Scholar
Integer programming, lattice algorithms, and deterministic volume estimation
D. Dadush
201280 citations
Semantic Scholar
A friendly smoothed analysis of the simplex method
D. Dadush, Sophie Huiberts
2017Symposium on the Theory of Computing62 citations Open access
Semantic Scholar
Unconditional differentially private mechanisms for linear queries
Aditya Bhaskara, D. Dadush, R. Krishnaswamy, Kunal Talwar
2012Symposium on the Theory of Computing57 citations
Semantic Scholar
On the Closest Vector Problem with a Distance Guarantee
D. Dadush, O. Regev, N. Stephens-Davidowitz
2014Cybersecurity and Cyberforensics Conference53 citations Open access
Semantic Scholar
The split closure of a strictly convex body
D. Dadush, S. Dey, J. Vielma
2011Operations Research Letters52 citations Open access
Semantic Scholar
On the existence of 0/1 polytopes with high semidefinite extension complexity
J. Briët, D. Dadush, Sebastian Pokutta
2013Mathematical programming44 citations Open access
Semantic Scholar
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem
D. Dadush, S. Garg, Shachar Lovett, Aleksandar Nikolov
2016International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques43 citations Open access
Semantic Scholar
On the Chvátal–Gomory closure of a compact convex set
D. Dadush, S. Dey, J. Vielma
2010Mathematical programming38 citations Open access
Semantic Scholar
On the Shadow Simplex Method for Curved Polyhedra
D. Dadush, Nicolai Hahnle
2014Discrete & Computational Geometry35 citations Open access
Semantic Scholar
On the Lattice Smoothing Parameter Problem
Kai-Min Chung, D. Dadush, Feng-Hao Liu, Chris Peikert
20132013 IEEE Conference on Computational Complexity33 citations
Semantic Scholar
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
D. Dadush, Sophie Huiberts, Bento Natura, L. Végh
2019Mathematical programming31 citations Open access
Semantic Scholar
On the complexity of branching proofs
D. Dadush, Samarth Tiwari
2020Cybersecurity and Cyberforensics Conference30 citations
Semantic Scholar
The Chvátal-Gomory Closure of a Strictly Convex Body
D. Dadush, S. Dey, J. Vielma
2011Mathematics of Operations Research30 citations Open access
Semantic Scholar
Near-optimal deterministic algorithms for volume computation via M-ellipsoids
D. Dadush, S. Vempala
2012Proceedings of the National Academy of Sciences of the United States of America25 citations Open access
Semantic Scholar
On the integrality gap of binary integer programs with Gaussian data
Sander Borst, D. Dadush, Sophie Huiberts, Samarth Tiwari
2020Mathematical programming24 citations
Semantic Scholar
Towards Strong Reverse Minkowski-Type Inequalities for Lattices
D. Dadush, O. Regev
2016IEEE Annual Symposium on Foundations of Computer Science23 citations Open access
Semantic Scholar
Algorithms for the Densest Sub-Lattice Problem
D. Dadush, Daniele Micciancio
2013ACM-SIAM Symposium on Discrete Algorithms23 citations
Semantic Scholar
Lattice Sparsification and the Approximate Closest Vector Problem
D. Dadush, G. Kun
2012Theory of Computing23 citations Open access
Semantic Scholar
Balancing Vectors in Any Norm
D. Dadush, Aleksandar Nikolov, Kunal Talwar, N. Tomczak-Jaegermann
2018IEEE Annual Symposium on Foundations of Computer Science22 citations
Semantic Scholar
A new framework for matrix discrepancy: partial coloring bounds via mirror descent
D. Dadush, Haotian Jiang, Victor Reis
2021Symposium on the Theory of Computing21 citations Open access
Semantic Scholar
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
D. Dadush, Bento Natura, L. Végh
2020IEEE Annual Symposium on Foundations of Computer Science21 citations Open access
Semantic Scholar
Geometric Rescaling Algorithms for Submodular Function Minimization
D. Dadush, L. Végh, G. Zambelli
2017ACM-SIAM Symposium on Discrete Algorithms21 citations Open access
Semantic Scholar
Thin partitions: isoperimetric inequalities and a sampling algorithm for star shaped bodies
K. Chandrasekaran, D. Dadush, S. Vempala
2010ACM-SIAM Symposium on Discrete Algorithms19 citations
Semantic Scholar
A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column
D. Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more
2024Symposium on the Theory of Computing18 citations Open access
Semantic Scholar
Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing
D. Dadush, N. Bonifas
2014ACM-SIAM Symposium on Discrete Algorithms18 citations Open access
Semantic Scholar
A Randomized Sieving Algorithm for Approximate Integer Programming
D. Dadush
2014Algorithmica17 citations
Semantic Scholar
Interior point methods are not worse than Simplex
Xavier Allamigeon, D. Dadush, Georg Loho, Bento Natura +1 more
2022IEEE Annual Symposium on Foundations of Computer Science16 citations Open access
Semantic Scholar
On circuit diameter bounds via circuit imbalances
D. Dadush, Zhuan Khye Koh, Bento Natura, L. Végh
2021Mathematical programming15 citations Open access
Semantic Scholar
Rescaling Algorithms for Linear Conic Feasibility
D. Dadush, L. Végh, G. Zambelli
2016Mathematics of Operations Research15 citations Open access
Semantic Scholar
AWGN-Goodness Is Enough: Capacity-Achieving Lattice Codes Based on Dithered Probabilistic Shaping
Antonio Campello, D. Dadush, Cong Ling
2017IEEE Transactions on Information Theory14 citations Open access
Semantic Scholar
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
D. Dadush, S. Vempala
2011ACM-SIAM Symposium on Discrete Algorithms12 citations
Semantic Scholar
Smoothed Analysis of the Simplex Method
D. Dadush, Sophie Huiberts
2020Beyond the Worst-Case Analysis of Algorithms11 citations Open access
Semantic Scholar
On approximating the covering radius and finding dense lattice subspaces
D. Dadush
2019Symposium on the Theory of Computing11 citations Open access
Semantic Scholar
Rescaled Coordinate Descent Methods for Linear Programming
D. Dadush, L. Végh, G. Zambelli
2016Conference on Integer Programming and Combinatorial Optimization10 citations Open access
Semantic Scholar
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
D. Dadush, Chris Peikert, S. Vempala
2010arXiv.org10 citations
Semantic Scholar
From approximate to exact integer programming
D. Dadush, F. Eisenbrand, T. Rothvoss
2022Mathematical programming9 citations Open access
Semantic Scholar
Integrality Gaps for Random Integer Programs via Discrepancy
Sander Borst, D. Dadush, Dan Mikulincer
2022ACM-SIAM Symposium on Discrete Algorithms8 citations
Semantic Scholar
Majorizing Measures for the Optimizer
Sander Borst, D. Dadush, Neil Olver, Makrand Sinha
2020Information Technology Convergence and Services8 citations
Semantic Scholar
Fast, Deterministic and Sparse Dimensionality Reduction
D. Dadush, Cristóbal Guzmán, Neil Olver
2018ACM-SIAM Symposium on Discrete Algorithms8 citations Open access
Semantic Scholar
On the Chvátal–Gomory closure of a compact convex set
D. Dadush, S. Dey, J. Vielma
2011Mathematical programming8 citations Open access
Semantic Scholar
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes
Gilles Bonnet, D. Dadush, U. Grupel, Sophie Huiberts +1 more
2021International Symposium on Computational Geometry7 citations
Semantic Scholar
On the Lattice Distortion Problem
Huck Bennett, D. Dadush, Noah Stephens-Davidowitz
2016Embedded Systems and Applications7 citations
Semantic Scholar
Optimizing Low Dimensional Functions over the Integers
D. Dadush, A. L'eonard, Lars Rohwedder, José Verschae
2023Conference on Integer Programming and Combinatorial Optimization6 citations Open access
Semantic Scholar
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems
D. Dadush, Zhuan Khye Koh, Bento Natura, L. Végh
2020Embedded Systems and Applications6 citations
Semantic Scholar
Rescaling Algorithms for Linear Programming - Part I: Conic feasibility
D. Dadush, L. Végh, G. Zambelli
2016arXiv.org6 citations
Semantic Scholar
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming
D. Dadush
2011Latin American Symposium on Theoretical Informatics6 citations
Semantic Scholar