Daniel Dadush

Cited by

	All	Since 2018
Citations	1357	958
h-index	22	17
i10-index	34	29

280

140

210

201020112012201320142015201620172018201920202021202220234 18 16 54 47 65 67 97 126 116 143 177 263 123

Public access

View all

25 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Santosh S. VempalaGeorgia TechVerified email at gatech.edu
László A. VéghDepartment of Mathematics, London School of Economics and Political ScienceVerified email at lse.ac.uk
Noah Stephens-DavidowitzCornell UniversityVerified email at cornell.edu
Santanu S. DeyGeorgia Institute of TechnologyVerified email at isye.gatech.edu
Juan Pablo VielmaResearch Scientist, GoogleVerified email at google.com
Oded RegevProfessor of Computer ScienceVerified email at cims.nyu.edu
Chris PeikertProfessor, Computer Science and Engineering, University of MichiganVerified email at alum.mit.edu
Divesh AggarwalNUSVerified email at nus.edu.sg
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoVerified email at eng.ucsd.edu
Nikhil BansalUniversity of MichiganVerified email at umich.edu
Kunal TalwarApple IncVerified email at apple.com
Aleksandar NikolovUniversity of TorontoVerified email at cs.toronto.edu
Karthekeyan ChandrasekaranUniversity of Illinois, Urbana-ChampaignVerified email at illinois.edu
Kai-Min ChungInstitute of Information Science, Academia SinicaVerified email at iis.sinica.edu.tw
Aditya BhaskaraUniversity of UtahVerified email at cs.utah.edu
Ravishankar KrishnaswamyMicrosoft ResearchVerified email at cs.cmu.edu
Jop BriëtCWIVerified email at cwi.nl
Feng-Hao LiuFlorida Atlantic UniversityVerified email at fau.edu
Nicolas BonifasÉcole Polytechnique & IBM France LabVerified email at polytechnique.edu
Daniele MicciancioProfessor of computer science, UCSDVerified email at eng.ucsd.edu

Daniel Dadush

Centrum Wiskunde & Informatica

Verified email at cwi.nl - Homepage

Algorithms Complexity Geometry


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Solving the Shortest Vector Problem in 2ⁿ 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	168	2015
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	115	2011
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	81	2015
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	62	2019
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	61	2018
The split closure of a strictly convex body D Dadush, SS Dey, JP Vielma Operations Research Letters 39 (2), 121-126, 2011	58	2011
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	51	2012
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	50	2014
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	50	2014
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	47	2018
Integer programming, lattice algorithms, and deterministic volume estimation DN Dadush Georgia Institute of Technology, 2012	46	2012
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	42	2015
On the complexity of branching proofs D Dadush, S Tiwari arXiv preprint arXiv:2006.04124, 2020	29	2020
On the lattice smoothing parameter problem KM Chung, D Dadush, FH Liu, C Peikert 2013 IEEE Conference on Computational Complexity, 230-241, 2013	29	2013
On the Chvátal–Gomory closure of a compact convex set D Dadush, SS Dey, JP Vielma Mathematical Programming 145, 327-348, 2014	27	2014
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	26	2020
On the shadow simplex method for curved polyhedra D Dadush, N Hähnle Discrete & Computational Geometry 56, 882-909, 2016	26	2016
A randomized sieving algorithm for approximate integer programming D Dadush Algorithmica 70 (2), 208-244, 2014	26	2014
A randomized sieving algorithm for approximate integer programming D Dadush Algorithmica 70 (2), 208-244, 2014	26	2014
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	26	2013

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors