| Publication | Date of Publication | Type |
|---|
Convex minimization with integer minima in \(\widetilde{O} (n^4)\) time
| 2024-11-28 | Paper |
Short-step methods are not strongly polynomial-time
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
| 2024-07-19 | Paper |
Computing Lewis weights to high precision
| 2024-07-19 | Paper |
The manifold joys of sampling (invited talk)
| 2024-06-24 | Paper |
Upper and lower bounds on the smoothed complexity of the simplex method
| 2024-05-08 | Paper |
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Reducing isotropy and volume to KLS: an o *( n 3 ψ 2 ) volume algorithm
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler
| 2023-02-12 | Paper |
Solving Linear Programs in the Current Matrix Multiplication Time
Journal of the ACM | 2022-12-08 | Paper |
Kernel-based Methods for Bandit Convex Optimization
Journal of the ACM | 2022-12-08 | Paper |
A Slightly Improved Bound for the KLS Constant
| 2022-08-24 | Paper |
Private Convex Optimization in General Norms
| 2022-07-17 | Paper |
Geodesic Walks in Polytopes
SIAM Journal on Computing | 2022-05-03 | Paper |
Short-step Methods Are Not Strongly Polynomial-Time
| 2022-01-08 | Paper |
A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions
| 2021-12-13 | Paper |
Universal Barrier Is n-Self-Concordant
Mathematics of Operations Research | 2021-09-14 | Paper |
Metrical task systems on trees via mirror descent and unfair gluing
SIAM Journal on Computing | 2021-06-22 | Paper |
Chasing Nested Convex Bodies Nearly Optimally
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Differentially Private Release of Synthetic Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Computing Circle Packing Representations of Planar Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Solving tall dense linear programs in nearly linear time
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
An improved cutting plane method for convex optimization, convex-concave games, and its applications
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Positive semidefinite programming: mixed, parallel, and width-independent
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Strong self-concordance and sampling
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Infinite propagation speed for wave solutions on some post-critically finite fractals
Analysis, Probability and Mathematical Physics on Fractals | 2020-12-02 | Paper |
A generalized central limit conjecture for convex bodies
Lecture Notes in Mathematics | 2020-08-21 | Paper |
Efficient convex optimization with oracles
Bolyai Society Mathematical Studies | 2020-07-08 | Paper |
Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent
| 2020-02-12 | Paper |
Optimal convergence rates for convex distributed optimization in networks
| 2020-02-07 | Paper |
Solving Tall Dense Linear Programs in Nearly Linear Time
| 2020-02-06 | Paper |
Solving linear programs in the current matrix multiplication time
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Competitively chasing convex bodies
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
The Kannan-Lovász-Simonovits conjecture
Current Developments in Mathematics | 2019-11-12 | Paper |
A Nearly-Linear Bound for Chasing Nested Convex Bodies
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Metrical task systems on trees via mirror descent and unfair gluing
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The Randomized Midpoint Method for Log-Concave Sampling
| 2019-09-12 | Paper |
A matrix expander Chernoff bound
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The Paulsen problem, continuous operator scaling, and smoothed analysis
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
\(k\)-server via multiscale entropic regularization
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
An homotopy method for l p regression provably beyond self-concordance and in input-sparsity time
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Constructing linear-sized spectral sparsification in almost-linear time
SIAM Journal on Computing | 2018-12-19 | Paper |
Near-optimal method for highly smooth convex optimization
| 2018-12-19 | Paper |
Universal Barrier is $n$-Self-Concordant
| 2018-09-09 | Paper |
Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved Cheeger's inequality and analysis of local graph partitioning using vertex expansion and expansion profile
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Sparsified Cholesky and multigrid solvers for connection Laplacians
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Geometric median in nearly linear time
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
An SDP-based algorithm for linear-sized spectral sparsification
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Subquadratic submodular function minimization
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Geodesic walks in polytopes
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Kernel-based methods for bandit convex optimization
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Improved Cheeger's inequality and analysis of local graph partitioning using vertex expansion and expansion profile
SIAM Journal on Computing | 2017-05-30 | Paper |
Uniform sampling for matrix approximation
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Single pass spectral sparsification in dynamic streams
SIAM Journal on Computing | 2017-03-10 | Paper |
Eldan's Stochastic Localization and the KLS Conjecture: Isoperimetry, Concentration and Mixing
| 2016-12-05 | Paper |
Landmark-matching transformation with large deformation via \(n\)-dimensional quasi-conformal maps
Journal of Scientific Computing | 2016-07-05 | Paper |
Improved Cheeger's inequality, analysis of spectral partitioning algorithms through higher order spectral gap
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Infinite Propagation Speed For Wave Solutions on Some P.C.F. Fractals
| 2011-11-12 | Paper |
