A new approach to computing maximum flows using electrical flows
An homotopy method for lp regression provably beyond self-concordance and in input-sparsity time
The Paulsen problem, continuous operator scaling, and smoothed analysis
Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC ’13
2014 IEEE 55th Annual Symposium on Foundations of Computer Science
Nikhil Srivastava
Satish Rao
Lap Chi Lau
Tsz Chiu Kwok
Yuanzhi Li
Michael B. Cohen
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space