1. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems;Spielman,2004
2. Faster algorithms for computing the stationary distribution, simulating random walks, and more;Cohen,2016
3. Solving directed Laplacian systems in nearly-linear time through sparse LU factorizations;Cohen,2018
4. Distributed algorithms for solving a linear equation under a directed graph;Tang,2018
5. Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs;Christiano,2011