Daniel Dadush

Citado por

	Total	Desde 2019
Citas	1660	1115
Índice h	23	18
Índice i10	38	29

260

130

195

2011201220132014201520162017201820192020202120222023202417 19 55 47 68 74 100 130 121 137 162 230 245 207

Acceso público

Ver todo

29 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

László A. VéghDepartment of Mathematics, London School of Economics and Political ScienceDirección de correo verificada de lse.ac.uk
Santosh S. VempalaGeorgia TechDirección de correo verificada de gatech.edu
Noah Stephens-DavidowitzCornell UniversityDirección de correo verificada de cornell.edu
Oded RegevProfessor of Computer ScienceDirección de correo verificada de cims.nyu.edu
Santanu S. DeyGeorgia Institute of TechnologyDirección de correo verificada de isye.gatech.edu
Juan Pablo VielmaResearch Scientist, GoogleDirección de correo verificada de google.com
Divesh AggarwalNUSDirección de correo verificada de nus.edu.sg
Chris PeikertProfessor, Computer Science and Engineering, University of MichiganDirección de correo verificada de alum.mit.edu
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoDirección de correo verificada de eng.ucsd.edu
Nikhil BansalUniversity of MichiganDirección de correo verificada de umich.edu
Aleksandar NikolovUniversity of TorontoDirección de correo verificada de cs.toronto.edu
Kunal TalwarApple IncDirección de correo verificada de apple.com
Karthekeyan ChandrasekaranUniversity of Illinois, Urbana-ChampaignDirección de correo verificada de illinois.edu
Kai-Min ChungInstitute of Information Science, Academia SinicaDirección de correo verificada de iis.sinica.edu.tw
Aditya BhaskaraUniversity of UtahDirección de correo verificada de cs.utah.edu
Ravishankar KrishnaswamyMicrosoft ResearchDirección de correo verificada de cs.cmu.edu
Jop BriëtCWIDirección de correo verificada de cwi.nl
Feng-Hao LiuWashington State UniversityDirección de correo verificada de wsu.edu
Nicolas BonifasÉcole Polytechnique & IBM France LabDirección de correo verificada de polytechnique.edu
Huck BennettUniversity of Colorado BoulderDirección de correo verificada de colorado.edu

Seguir

Daniel Dadush

Centrum Wiskunde & Informatica

Dirección de correo verificada de cwi.nl - Página principal

Algorithms Complexity Geometry


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	207	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	123	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	96	2015
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	80	2018
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	77	2019
Integer programming, lattice algorithms, and deterministic volume estimation DN Dadush Georgia Institute of Technology, 2012	73	2012
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	68	2018
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	61	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	60	2014
The split closure of a strictly convex body D Dadush, SS Dey, JP Vielma Operations Research Letters 39 (2), 121-126, 2011	59	2011
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	43	2015
On the lattice smoothing parameter problem KM Chung, D Dadush, FH Liu, C Peikert 2013 IEEE Conference on Computational Complexity, 230-241, 2013	37	2013
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	35	2020
On the complexity of branching proofs D Dadush, S Tiwari arXiv preprint arXiv:2006.04124, 2020	35	2020
On the shadow simplex method for curved polyhedra D Dadush, N Hähnle Discrete & Computational Geometry 56, 882-909, 2016	33	2016
Short paths on the Voronoi graph and closest vector problem with preprocessing D Dadush, N Bonifas Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014	29	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	28	2013
Geometric rescaling algorithms for submodular function minimization D Dadush, LA Végh, G Zambelli Mathematics of Operations Research 46 (3), 1081-1108, 2021	26	2021
Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers D Dadush, B Natura, LA Végh 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020	26	2020
On the Chvátal–Gomory closure of a compact convex set D Dadush, SS Dey, JP Vielma Mathematical Programming 145, 327-348, 2014	26	2014

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores