Daniel Dadush

Available identifiers

zbMath Open dadush.danielWikidataQ93647262 ScholiaQ93647262MaRDI QIDQ486989

List of research outcomes

Publication	Date of Publication	Type
An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems	2024-03-01	Paper
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix	2024-02-21	Paper
A new framework for matrix discrepancy: partial coloring bounds via mirror descent	2023-12-08	Paper
A nearly optimal randomized algorithm for explorable heap selection	2023-11-09	Paper
From approximate to exact integer programming	2023-11-09	Paper
Optimizing low dimensional functions over the integers	2023-11-09	Paper
An accelerated Newton-dinkelbach method and its application to two variables per inequality systems	2023-09-20	Paper
On the integrality gap of binary integer programs with Gaussian data	2023-03-14	Paper
On circuit diameter bounds via circuit imbalances	2022-08-16	Paper
A simple method for convex optimization in the oracle model	2022-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q5092485	2022-07-21	Paper
Smoothed Analysis of the Simplex Method	2022-02-04	Paper
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes	2021-12-24	Paper
On the integrality gap of binary integer programs with Gaussian data	2021-12-21	Paper
Lattice-based locality sensitive hashing is optimal	2021-06-15	Paper
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix	2021-01-19	Paper
A Friendly Smoothed Analysis of the Simplex Method	2020-10-26	Paper
Rescaling Algorithms for Linear Conic Feasibility	2020-09-01	Paper
On the Complexity of Branching Proofs	2020-06-07	Paper
https://portal.mardi4nfdi.de/entity/Q5215661	2020-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q5215668	2020-02-12	Paper
On approximating the covering radius and finding dense lattice subspaces	2020-01-30	Paper
A friendly smoothed analysis of the simplex method	2019-08-22	Paper
The Gram-Schmidt walk: a cure for the Banaszczyk blues	2019-08-22	Paper
Lattice Sparsification and the Approximate Closest Vector Problem	2019-05-15	Paper
Algorithms for the Densest Sub-Lattice Problem	2019-05-15	Paper
Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms	2019-05-10	Paper
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound	2019-05-07	Paper
AWGN-Goodness Is Enough: Capacity-Achieving Lattice Codes Based on Dithered Probabilistic Shaping	2019-03-28	Paper
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem	2018-04-19	Paper
Geometric Rescaling Algorithms for Submodular Function Minimization	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607975	2018-03-15	Paper
On the Lattice Distortion Problem	2018-03-02	Paper
On the Shadow Simplex Method for Curved Polyhedra	2017-10-10	Paper
Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings	2017-10-10	Paper
Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing	2017-10-05	Paper
On the shadow simplex method for curved polyhedra	2016-12-20	Paper
Rescaled Coordinate Descent Methods for Linear Programming	2016-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q5741633	2016-07-29	Paper
Towards Strong Reverse Minkowski-type Inequalities for Lattices	2016-06-22	Paper
On the existence of 0/1 polytopes with high semidefinite extension complexity	2015-10-14	Paper
Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling	2015-08-21	Paper
A randomized sieving algorithm for approximate integer programming	2015-01-19	Paper
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings	2014-07-30	Paper
Near-optimal deterministic algorithms for volume computation via M-ellipsoids	2014-07-25	Paper
On the Chvátal-Gomory closure of a compact convex set	2014-06-27	Paper
Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families	2014-05-22	Paper
Unconditional differentially private mechanisms for linear queries	2014-05-13	Paper
On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity	2013-09-17	Paper
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming	2012-06-29	Paper
The Chvátal-Gomory Closure of a Strictly Convex Body	2012-05-24	Paper
The split closure of a strictly convex body	2011-08-09	Paper
On the Chvátal-Gomory Closure of a Compact Convex Set	2011-06-24	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Daniel Dadush