Daniel Dadush - RankMe

116 papers A* 30A 9B 9Journal 65Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. Discret. Comput. Geom. Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna V. Livshyts
2026	A*	`conf`	Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure. SODA Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer
2026	A*	`conf`	From Incremental Transitive Cover to Strongly Polynomial Maximum Flow. SODA Daniel Dadush, James B. Orlin, Aaron Sidford, László A. Végh
2025	A	`conf`	A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk). STACS Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
2025	J	`jnl`	A nearly optimal randomized algorithm for explorable heap selection. Math. Program. Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2025	J	`jnl`	Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure. CoRR Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer
2025	J	`jnl`	From Incremental Transitive Cover to Strongly Polynomial Maximum Flow. CoRR Daniel Dadush, James B. Orlin, Aaron Sidford, László A. Végh
2025	J	`jnl`	From approximate to exact integer programming. Math. Program. Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
2025	J	`jnl`	Greedy Algorithms for Shortcut Sets and Hopsets. CoRR Ben Bals, Joakim Blikstad, Greg Bodwin, Daniel Dadush, Sebastian Forster, Yasamin Nazari
2025	J	`jnl`	Interior Point Methods Are Not Worse than Simplex. SIAM J. Comput. Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
2024	A*	`conf`	A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. STOC Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
2024	J	`jnl`	A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Math. Program. Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2024	J	`jnl`	A simple method for convex optimization in the oracle model. Math. Program. Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
2024	J	`jnl`	Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Trans. Algorithms Daniel Dadush, Martin Milanic, Tami Tamir
2024	J	`jnl`	On circuit diameter bounds via circuit imbalances. Math. Program. Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2024	A*	`conf`	Strongly Polynomial Frame Scaling to High Precision. SODA Daniel Dadush, Akshay Ramachandran
2024	J	`jnl`	Strongly Polynomial Frame Scaling to High Precision. CoRR Daniel Dadush, Akshay Ramachandran
2023	B	`conf`	A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. IPCO Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2023	J	`jnl`	An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. Math. Oper. Res. Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2023	B	`conf`	From Approximate to Exact Integer Programming. IPCO Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
2023	A*	`conf`	Integrality Gaps for Random Integer Programs via Discrepancy. SODA Sander Borst, Daniel Dadush, Dan Mikulincer
2023	J	`jnl`	On the integrality gap of binary integer programs with Gaussian data. Math. Program. Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
2023	B	`conf`	Optimizing Low Dimensional Functions over the Integers. IPCO Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
2023	J	`jnl`	Optimizing Low Dimensional Functions over the Integers. CoRR Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
2022	B	`conf`	A Simple Method for Convex Optimization in the Oracle Model. IPCO Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
2022	J	`jnl`	A nearly optimal randomized algorithm for explorable heap selection. CoRR Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2022	A*	`conf`	A new framework for matrix discrepancy: partial coloring bounds via mirror descent. STOC Daniel Dadush, Haotian Jiang, Victor Reis
2022	A*	`conf`	Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. SoCG Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna V. Livshyts
2022	J	`jnl`	From approximate to exact integer programming. CoRR Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
2022	A*	`conf`	Interior point methods are not worse than Simplex. FOCS Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
2022	J	`jnl`	Interior point methods are not worse than Simplex. CoRR Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
2022	B	`conf`	On Circuit Diameter Bounds via Circuit Imbalances. IPCO Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2022	A*	`conf`	On finding exact solutions of linear programs in the oracle model. SODA Daniel Dadush, László A. Végh, Giacomo Zambelli
2021	J	`jnl`	A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent. CoRR Daniel Dadush, Haotian Jiang, Victor Reis
2021	A	`conf`	An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. ESA Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2021	J	`jnl`	Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. CoRR Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna V. Livshyts
2021	A	`conf`	Majorizing Measures for the Optimizer. ITCS Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
2021	J	`jnl`	On Circuit Diameter Bounds via Circuit Imbalances. CoRR Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2021	B	`conf`	On the Integrality Gap of Binary Integer Programs with Gaussian Data. IPCO Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
2020	J	`jnl`	A Friendly Smoothed Analysis of the Simplex Method. SIAM J. Comput. Daniel Dadush, Sophie Huiberts
2020	A*	`conf`	A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. STOC Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2020	J	`jnl`	Majorizing Measures for the Optimizer. CoRR Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
2020	A	`conf`	On the Complexity of Branching Proofs. CCC Daniel Dadush, Samarth Tiwari
2020	J	`jnl`	On the Complexity of Branching Proofs. CoRR Daniel Dadush, Samarth Tiwari
2020	J	`jnl`	On the Integrality Gap of Binary Integer Programs with Gaussian Data. CoRR Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
2020	J	`jnl`	Rescaling Algorithms for Linear Conic Feasibility. Math. Oper. Res. Daniel Dadush, László A. Végh, Giacomo Zambelli
2020	A*	`conf`	Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. FOCS Daniel Dadush, Bento Natura, László A. Végh
2020	J	`jnl`	Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. CoRR Daniel Dadush, Bento Natura, László A. Végh
2020	J	`jnl`	Simple Iterative Methods for Linear Optimization over Convex Sets. CoRR Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
2020	—	`ch.`	Smoothed Analysis of the Simplex Method. Beyond the Worst-Case Analysis of Algorithms Daniel Dadush, Sophie Huiberts
2019	J	`jnl`	A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. CoRR Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2019	J	`jnl`	AWGN-Goodness Is Enough: Capacity-Achieving Lattice Codes Based on Dithered Probabilistic Shaping. IEEE Trans. Inf. Theory Antonio Campello, Daniel Dadush, Cong Ling
2019	J	`jnl`	An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. SIAM J. Comput. Nikhil Bansal, Daniel Dadush, Shashwat Garg
2019	A*	`conf`	On approximating the covering radius and finding dense lattice subspaces. STOC Daniel Dadush
2019	J	`jnl`	The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. Theory Comput. Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
2019	J	`jnl`	Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. Theory Comput. Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov
2018	A*	`conf`	A friendly smoothed analysis of the simplex method. STOC Daniel Dadush, Sophie Huiberts
2018	A*	`conf`	Balancing Vectors in Any Norm. FOCS Daniel Dadush, Aleksandar Nikolov, Kunal Talwar, Nicole Tomczak-Jaegermann
2018	A*	`conf`	Fast, Deterministic and Sparse Dimensionality Reduction. SODA Daniel Dadush, Cristóbal Guzmán, Neil Olver
2018	A*	`conf`	Geometric Rescaling Algorithms for Submodular Function Minimization. SODA Daniel Dadush, László A. Végh, Giacomo Zambelli
2018	A	`conf`	Lattice-based Locality Sensitive Hashing is Optimal. ITCS Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
2018	A*	`conf`	The gram-schmidt walk: a cure for the Banaszczyk blues. STOC Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
2017	J	`jnl`	A Friendly Smoothed Analysis of the Simplex Method. CoRR Daniel Dadush, Sophie Huiberts
2017	J	`jnl`	AWGN-Goodness is Enough: Capacity-Achieving Lattice Codes based on Dithered Probabilistic Shaping. CoRR Antonio Campello, Daniel Dadush
2017	J	`jnl`	Geometric Rescaling Algorithms for Submodular Function Minimization. CoRR Daniel Dadush, László A. Végh, Giacomo Zambelli
2017	J	`jnl`	Lattice-based Locality Sensitive Hashing is Optimal. CoRR Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu
2017	J	`jnl`	The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. CoRR Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
2016	A*	`conf`	An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. FOCS Nikhil Bansal, Daniel Dadush, Shashwat Garg
2016	J	`jnl`	An Algorithm for Komlós Conjecture Matching Banaszczyk's bound. CoRR Nikhil Bansal, Daniel Dadush, Shashwat Garg
2016	J	`jnl`	Lattice Sparsification and the Approximate Closest Vector Problem. Theory Comput. Daniel Dadush, Gábor Kun
2016	A	`conf`	On the Lattice Distortion Problem. ESA Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz
2016	J	`jnl`	On the Lattice Distortion Problem. CoRR Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz
2016	J	`jnl`	On the Shadow Simplex Method for Curved Polyhedra. Discret. Comput. Geom. Daniel Dadush, Nicolai Hähnle
2016	B	`conf`	Rescaled Coordinate Descent Methods for Linear Programming. IPCO Daniel Dadush, László A. Végh, Giacomo Zambelli
2016	J	`jnl`	Rescaling Algorithms for Linear Programming - Part I: Conic feasibility. CoRR Daniel Dadush, László A. Végh, Giacomo Zambelli
2016	A*	`conf`	Towards Strong Reverse Minkowski-Type Inequalities for Lattices. FOCS Daniel Dadush, Oded Regev
2016	J	`jnl`	Towards Strong Reverse Minkowski-type Inequalities for Lattices. CoRR Daniel Dadush, Oded Regev
2016	—	`conf`	Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. APPROX-RANDOM Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov
2016	J	`jnl`	Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. CoRR Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov
2015	A*	`conf`	Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings. SoCG Daniel Dadush
2015	A*	`conf`	On the Shadow Simplex Method for Curved Polyhedra. SoCG Daniel Dadush, Nicolai Hähnle
2015	J	`jnl`	On the existence of 0/1 polytopes with high semidefinite extension complexity. Math. Program. Jop Briët, Daniel Dadush, Sebastian Pokutta
2015	A*	`conf`	Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing. SODA Daniel Dadush, Nicolas Bonifas
2015	J	`jnl`	Solving the Closest Vector Problem in $2^n$ Time - The Discrete Gaussian Strikes Again! CoRR Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz
2015	A*	`conf`	Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again! FOCS Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz
2015	A*	`conf`	Solving the Shortest Vector Problem in 2 STOC Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2014	J	`jnl`	A Randomized Sieving Algorithm for Approximate Integer Programming. Algorithmica Daniel Dadush
2014	J	`jnl`	On the Chvátal-Gomory closure of a compact convex set. Math. Program. Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
2014	A	`conf`	On the Closest Vector Problem with a Distance Guarantee. CCC Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2014	J	`jnl`	On the Closest Vector Problem with a Distance Guarantee. CoRR Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2014	J	`jnl`	On the Lattice Smoothing Parameter Problem. CoRR Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert
2014	J	`jnl`	On the Shadow Simplex Method for Curved Polyhedra. CoRR Daniel Dadush, Nicolai Hähnle
2014	J	`jnl`	Short Paths on the Voronoi Graph and the Closest Vector Problem with Preprocessing. CoRR Nicolas Bonifas, Daniel Dadush
2014	J	`jnl`	Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling. CoRR Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2013	J	`jnl`	A Deterministic Polynomial Space Construction for eps-nets under any Norm. CoRR Daniel Dadush
2013	A*	`conf`	Algorithms for the Densest Sub-Lattice Problem. SODA Daniel Dadush, Daniele Micciancio
2013	A*	`conf`	Lattice Sparsification and the Approximate Closest Vector Problem. SODA Daniel Dadush, Gábor Kun
2013	J	`jnl`	Near-optimal deterministic algorithms for volume computation via M-ellipsoids. Proc. Natl. Acad. Sci. USA Daniel Dadush, Santosh S. Vempala
2013	A	`conf`	On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity. ESA Jop Briët, Daniel Dadush, Sebastian Pokutta
2013	A	`conf`	On the Lattice Smoothing Parameter Problem. CCC Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert
2013	J	`jnl`	On the existence of 0/1 polytopes with high semidefinite extension complexity CoRR Jop Briët, Daniel Dadush, Sebastian Pokutta
2012	B	`conf`	A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming. LATIN Daniel Dadush
2012	J	`jnl`	Deterministic 2^{O(n)} Algorithms for M-Ellipsoids, Lattice Problems and Volume Estimation CoRR Daniel Dadush, Santosh S. Vempala
2012	A*	`conf`	Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms. SODA Daniel Dadush, Santosh S. Vempala
2012	—	`—`	Integer programming, lattice algorithms, and deterministic volume estimation. Daniel Dadush
2012	J	`jnl`	Lattice Sparsification and the Approximate Closest Vector Problem CoRR Daniel Dadush, Gábor Kun
2012	A*	`conf`	Unconditional differentially private mechanisms for linear queries. STOC Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar
2011	J	`jnl`	A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming CoRR Daniel Dadush
2011	J	`jnl`	Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms CoRR Daniel Dadush, Santosh S. Vempala
2011	A*	`conf`	Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings. FOCS Daniel Dadush, Chris Peikert, Santosh S. Vempala
2011	B	`conf`	On the Chvátal-Gomory Closure of a Compact Convex Set. IPCO Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
2011	J	`jnl`	The Chvátal-Gomory Closure of a Strictly Convex Body. Math. Oper. Res. Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
2011	J	`jnl`	The split closure of a strictly convex body. Oper. Res. Lett. Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
2010	J	`jnl`	Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings CoRR Daniel Dadush, Chris Peikert, Santosh S. Vempala
2010	A*	`conf`	Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. SODA Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala
2009	J	`jnl`	Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families CoRR Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala