| Publication | Date of Publication | Type |
|---|
Round compression for parallel matching algorithms
SIAM Journal on Computing | 2020-10-29 | Paper |
Gradients and flows: continuous optimization approaches to the maximum flow problem
Proceedings of the International Congress of Mathematicians (ICM 2018) | 2020-09-22 | Paper |
\(k\)-server via multiscale entropic regularization
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
A polylogarithmic-competitive algorithm for the \(k\)-server problem
Journal of the ACM | 2018-08-02 | Paper |
Negative-weight shortest paths and unit capacity minimum cost flow in \(\tilde{O}(m^{10/7}\log W)\) time (extended abstract)
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| On the Resiliency of Randomized Routing Against Multiple Edge Failures | 2017-12-19 | Paper |
Fast generation of random spanning trees and the effective resistance metric
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
Operations Research | 2017-09-26 | Paper |
Runtime guarantees for regression problems
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
On the configuration LP for maximum budgeted allocation
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Faster Generation of Random Spanning Trees
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
On the configuration LP for maximum budgeted allocation
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
| An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem | 2014-05-22 | Paper |
| The semi-stochastic ski-rental problem | 2012-08-31 | Paper |
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science | 2011-06-07 | Paper |
Data exchange: on the complexity of answering queries with inequalities
Information Processing Letters | 2009-12-04 | Paper |
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Automata, Languages and Programming | 2009-07-14 | Paper |
Susceptible Two-Party Quantum Computations
Lecture Notes in Computer Science | 2009-01-09 | Paper |
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
Lecture Notes in Computer Science | 2008-04-15 | Paper |
