Daniel Dadush - Concepedia

Author

Daniel Dadush

New York University ORCID

Also Known As

Bansal, Nikhil, Caramanis, Constantine, D. Dadush, Dadush, Daniel, Dan Dadush, Daniel Dadush, Kai-Min Chung

121

Publications

1.1K

Citations

H-Index

Concepts

All Affiliations

New York University Georgia Institute of Technology Centrum Wiskunde & Informatica Courant Institute of Mathematical Sciences Eindhoven University of Technology

About

Daniel Dadush is an author at New York University specializing in engineering, computational complexity, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	12	12	435
2	Computer Science	8	8	340
3	Education	1	1	24
4	Natural Sciences	1	1	24
5	Data Science	1	1	89

Daniel Dadush

Publications

738

Citations

H-Index

Page 1

	Year	Citations
Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling Divesh Aggarwal, Daniel Dadush, Oded Regev, EngineeringDiscrete Gaussian SamplingData ScienceOptimization ProblemGaussian Process	2015	89
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings Daniel Dadush, Chris Peikert, Santosh Vempala Mathematical ProgrammingDiscrete GeometryEnumerative Lattice AlgorithmsLattice ProblemsEngineering	2011	80
Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again! Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz	2015	64
The split closure of a strictly convex body Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma Operations Research Letters Split ClosureExtremal Set TheorySet-theoretic TopologyConvex HullFunctional Analysis	2011	44
The Gram-Schmidt walk: a cure for the Banaszczyk blues Nikhil Bansal, Daniel Dadush, Shashwat Garg,	2018	41
Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling Divesh Aggarwal, Daniel Dadush, Oded Regev, arXiv (Cornell University) Mathematical ProgrammingEngineeringDiscrete Gaussian SamplingStochastic OptimizationGaussian Process	2014	41
Unconditional differentially private mechanisms for linear queries Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Mathematical ProgrammingPrivacy ProtectionComputational Complexity TheoryEngineeringComputational Complexity	2012	40
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound Nikhil Bansal, Daniel Dadush, Shashwat Garg Mathematical ProgrammingTheory Of ComputingComputational Complexity TheoryEngineeringLow Discrepancy	2016	32
On the Chvátal–Gomory closure of a compact convex set Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma Mathematical Programming Compact Convex SetEngineeringSet-theoretic TopologyConvex HullGomory-chvátal Theory	2013	30
A friendly smoothed analysis of the simplex method Daniel Dadush, Sophie Huiberts	2018	29

Page 1