| Publication | Date of Publication | Type |
|---|
Accelerated extra-gradient descent: a novel accelerated first-order method
(available as arXiv preprint) | 2021-06-15 | Paper |
Fair packing and covering on a relative scale
SIAM Journal on Optimization | 2020-12-11 | Paper |
Flow-based algorithms for local graph clustering
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | 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 |
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 |
Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence
Mathematical Programming. Series A. Series B | 2019-05-17 | Paper |
The approximate duality gap technique: a unified theory of first-order methods
SIAM Journal on Optimization | 2019-03-22 | Paper |
Expanders via local edge flips
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | 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 |
| Alternating Randomized Block Coordinate Descent | 2018-05-23 | Paper |
Linear coupling: an ultimate unification of gradient and mirror descent
(available as arXiv preprint) | 2018-05-03 | Paper |
Using optimization to break the epsilon barrier: a faster and simpler width-independent algorithm for solving positive linear programs in parallel
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition | 2017-09-29 | Paper |
Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition
(available as arXiv preprint) | 2017-09-29 | Paper |
Nearly-linear time positive LP solver with faster convergence rate
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Spectral sparsification and regret minimization beyond matrix multiplicative updates
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Using Optimization to Solve Positive LPs Faster in Parallel
(available as arXiv preprint) | 2014-07-07 | 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 |
| scientific article; zbMATH DE number 6276186 (Why is no real title available?) | 2014-04-01 | Paper |
| scientific article; zbMATH DE number 5485558 (Why is no real title available?) | 2009-01-05 | Paper |
Localized techniques for broadcasting in wireless sensor networks
Algorithmica | 2008-02-18 | Paper |
