1

Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate
Zeyuan Allen-Zhu, Lorenzo Orecchia
ACM ArXiv
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel
Zeyuan Allen-Zhu, Lorenzo Orecchia
ArXiv ACM
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
Co-winner of Best Paper Award at SODA 2014.
Jonathan A. Kelner, YinTat Lee, Lorenzo Orecchia, Aaron Sidford
DOI ArXiv SIAM
Approximating the Exponential, the Lanczos Method and an ilde{O}(m)-Time Spectral Algorithm for Balanced Separator
Sushant Sachdeva, Nisheeth K. Vishnoi
ArXiv
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
Zeyuan Allen-Zhu, Zhenyu Liao,
ArXiv ACM
Implementing Regularization Implicitly Via Approximate Eigenvector Computation
Michael W. Mahoney,
ArXiv ACM
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
Kevin J. Lang, Michael W. Mahoney,
Springer LNTCS