ACM - Normas
Yin Tat Lee
Satish Rao
Nikhil Srivastava
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC ’13
Smooth minimization of non-smooth functions
A Nearly-m log n Time Solver for SDD Linear Systems
Random sampling in residual graphs
Beyond the flow decomposition barrier
Perfect matchings in o(nlogn) time in regular bipartite graphs
Faster approximate lossy generalized flow via interior point algorithms