Daniel Dadush is an algorithms researcher at CWI in Amsterdam. He completed his PhD in the Georgia Tech ACO program in 2012, under the supervision of Santosh Vempala, and was a Simons Postdoctoral Fellow at NYU from 2012 to 2014. His research is focused on high-dimensional optimization and search problems that can be attacked by a combination of geometric and probabilistic techniques. Together with his coauthors, he developed the fastest exact algorithms for the classical shortest and closest vector problems and the integer programming problem, fast simplex algorithms and rescaling algorithms for linear programming, and new constructive methods in discrepancy minimization.
- Lattices: Algorithms, Complexity, and Cryptography, Spring 2020. Visiting Scientist and Workshop Organizer.
- Bridging Continuous and Discrete Optimization, Fall 2017. Visiting Scientist.