| Publication | Date of Publication | Type |
|---|
| Strongly polynomial frame scaling to high precision | 2024-11-28 | Paper |
| A simple method for convex optimization in the oracle model | 2024-08-20 | Paper |
| On circuit diameter bounds via circuit imbalances | 2024-08-20 | Paper |
| On finding exact solutions of linear programs in the oracle model | 2024-07-19 | Paper |
| Integrality gaps for random integer programs via discrepancy | 2024-05-14 | Paper |
| 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 |
| From approximate to exact integer programming | 2023-11-09 | Paper |
| Optimizing low dimensional functions over the integers | 2023-11-09 | Paper |
| A nearly optimal randomized algorithm for explorable heap selection | 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 |
| Towards a constructive version of Banaszczyk's vector balancing theorem | 2020-02-12 | Paper |
| The Gram-Schmidt walk: a cure for the Banaszczyk blues | 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 applications 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 |
| Fast, deterministic and sparse dimensionality reduction | 2018-03-15 | Paper |
| Geometric rescaling algorithms for submodular function minimization | 2018-03-15 | Paper |
| On the lattice distortion problem | 2018-03-02 | Paper |
| Faster deterministic volume estimation in the oracle model via thin lattice coverings | 2017-10-10 | Paper |
| On the shadow simplex method for curved polyhedra | 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 (extended abstract) | 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 a sampling algorithm for star shaped bodies | 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/\epsilon ^{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 |
| Integrality Gaps for Random Integer Programs via Discrepancy | N/A | Paper |
