The following pages link to Daniel Dadush (Q486989):
Displaying 50 items.
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- On the shadow simplex method for curved polyhedra (Q728496) (← links)
- On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
- On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
- A simple method for convex optimization in the oracle model (Q2164690) (← links)
- On the Chvátal-Gomory closure of a compact convex set (Q2248755) (← links)
- The split closure of a strictly convex body (Q2275578) (← links)
- On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity (Q2849312) (← links)
- The Chvátal-Gomory Closure of a Strictly Convex Body (Q2884272) (← links)
- A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming (Q2894466) (← links)
- Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling (Q2941568) (← links)
- On the Chvátal-Gomory Closure of a Compact Convex Set (Q3009756) (← links)
- Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
- On the Lattice Distortion Problem (Q4606278) (← links)
- Geometric Rescaling Algorithms for Submodular Function Minimization (Q4607936) (← links)
- (Q4607975) (← links)
- AWGN-Goodness Is Enough: Capacity-Achieving Lattice Codes Based on Dithered Probabilistic Shaping (Q4629947) (← links)
- An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound (Q4634029) (← links)
- Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem (Q4636461) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- Smoothed Analysis of the Simplex Method (Q5027280) (← links)
- (Q5092485) (← links)
- Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q5144961) (← links)
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids (Q5170985) (← links)
- On approximating the covering radius and finding dense lattice subspaces (Q5212842) (← links)
- (Q5215661) (← links)
- (Q5215668) (← links)
- A friendly smoothed analysis of the simplex method (Q5230305) (← links)
- The Gram-Schmidt walk: a cure for the Banaszczyk blues (Q5230322) (← links)
- Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing (Q5362978) (← links)
- On the Shadow Simplex Method for Curved Polyhedra (Q5368698) (← links)
- Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings (Q5368722) (← links)
- Unconditional differentially private mechanisms for linear queries (Q5415549) (← links)
- Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families (Q5417737) (← links)
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings (Q5494988) (← links)
- (Q5741633) (← links)
- Lattice Sparsification and the Approximate Closest Vector Problem (Q5741786) (← links)
- Algorithms for the Densest Sub-Lattice Problem (Q5741787) (← links)
- Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms (Q5743489) (← links)
- On the integrality gap of binary integer programs with Gaussian data (Q5918435) (← links)
- On the integrality gap of binary integer programs with Gaussian data (Q5925655) (← links)
- An accelerated Newton-dinkelbach method and its application to two variables per inequality systems (Q6075925) (← links)
- A new framework for matrix discrepancy: partial coloring bounds via mirror descent (Q6083519) (← links)
- A nearly optimal randomized algorithm for explorable heap selection (Q6085985) (← links)
- From approximate to exact integer programming (Q6085992) (← links)
- Optimizing low dimensional functions over the integers (Q6085994) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems (Q6122568) (← links)
