| Publication | Date of Publication | Type |
|---|
| Incremental approximate maximum flow on undirected graphs in subpolynomial update time | 2024-11-28 | Paper |
| Fast algorithms for separable linear programs | 2024-11-28 | Paper |
| Nested dissection meets IPMs: planar min-cost flow in nearly-linear time | 2024-07-19 | Paper |
| A new approach to estimating effective resistances and counting spanning trees in expander graphs | 2024-05-14 | Paper |
| A simple framework for finding balanced sparse cuts via APSP | 2024-05-14 | Paper |
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
SIAM Journal on Computing | 2023-12-19 | Paper |
Convergence results for neural networks via electrodynamics
(available as arXiv preprint) | 2021-06-15 | Paper |
Faster p-norm minimizing flows, via smoothed q-norm problems
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Faster p-norm minimizing flows, via smoothed q-norm problems
(available as arXiv preprint) | 2019-10-23 | Paper |
Iterative refinement for \(\ell_p\)-norm regression
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The mixing time of the Dikin walk in a polytope -- a simple proof
Operations Research Letters | 2019-01-11 | Paper |
A framework for analyzing resparsification algorithms
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Near-optimal approximation algorithm for simultaneous Max-Cut | 2018-03-15 | Paper |
Near-optimal approximation algorithm for simultaneous Max-Cut
(available as arXiv preprint) | 2018-03-15 | 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 |
Sampling random spanning trees faster than matrix multiplication
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
An arithmetic analogue of Fox's triangle removal argument
Online Journal of Analytic Combinatorics | 2016-03-02 | Paper |
An arithmetic analogue of Fox's triangle removal argument
Online Journal of Analytic Combinatorics | 2016-03-02 | Paper |
Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Simultaneous approximation of constraint satisfaction problems
Automata, Languages, and Programming | 2015-10-27 | Paper |
Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders
Algorithmica | 2015-05-21 | Paper |
| Algorithms for Lipschitz Learning on Graphs | 2015-05-01 | Paper |
Faster algorithms via approximation theory
Foundations and Trends® in Theoretical Computer Science | 2014-07-10 | Paper |
Faster algorithms via approximation theory
Foundations and Trends® in Theoretical Computer Science | 2014-07-10 | Paper |
Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Testing permanent oracles -- revisited
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Nearly optimal NP-hardness of vertex cover on \(k\)-uniform \(k\)-partite hypergraphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
