Daniel Dadush
Office: Room 429, Warren Weaver Hall
Email: dadush AT cs DOT nyu DOT edu
I am currently a Simons Postdoctoral Fellow at the
Courant Institute of Mathematical Sciences at New York University. Previously, I
was a Ph.D. student in the ACO (Algorithms, Combinatorics, and Optimization) program at Georgia Tech, where my advisor was Santosh Vempala (Professor of
Computer Science).
Theory Seminar:
I am the organizer for the NYU Theory seminar. You can see the current schedule here.
If you are interested in giving a talk, feel free to send me an email.
Teaching:
Here's my curriculum vitae (CV).
Research Interests:
- Algorithms for Integer Programming, Cutting Plane Methods
- Lattice Algorithms and the Geometry of Numbers
- Convex Optimization
- Deterministic Volume Computation
- Asymptotic Convex Geometry (properties of convex bodies as dimension tends to infinity)
- Geometric Random Walks
Research Awards:
- Informs JFIG Paper Competition, Finalist, 2010 & 2011.
- Informs Optimization Society Student Paper Prize, 2011.
Research Publications:
In Submission:
Conference Papers:
- On the Lattice Smoothing Parameter Problem.
K.M. Chung, D. Dadush, F.H. Liu, C. Peikert. To appear in CCC, 2013.
- Lattice Sparsification and the Approximate Closest Vector Problem.
D. Dadush, G. Kun. SODA, 2013
- Algorithms for the Densest Sublattice Problem
D. Dadush., D. Micciancio. SODA, 2013
- A O(1/eps^2)^n-time Sieving Algorithm for Approximate Integer Programming
D. Dadush. LATIN, 2012.
- Deterministic Construction of an Approximate M-Ellipsoid and its
Applications to Derandomizing Lattice Algorithms
D. Dadush and S. Vempala. SODA, 2012.
- Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid Coverings
D. Dadush, C. Peikert and S. Vempala.
FOCS 2011.
- Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
D. Dadush, C. Chandresekaran, and S. Vempala. SODA, 2010.
- On the Chvátal-Gomory Closure of a Compact Convex Set
D. Dadush, S.S. Dey and J.P. Vielma. IPCO, 2011.
Journal Articles:
- On the Chvátal-Gomory Closure of a Compact Convex Set
D. Dadush, S.S. Dey and J.P. Vielma. To Appear in Mathematical Programming A.
Optimization Society Student Paper Prize.
- The Chvátal-Gomory Closure of a Strictly Convex Body
D. Dadush, S.S. Dey, and J.P. Vielma. Mathematics of Operations Research, vol. 36, p. 227-239, 2011.
INFORMS JFIG Paper Competition Finalist.
- The Split Closure of a Strictly Convex Body
D. Dadush, S.S. Dey and J.P. Vielma. Operations Research Letters, vol. 39, p. 121-126, 2011.
PhD Thesis:
