We introduce a new algorithm and software for solving linear equations i...
The ℓ_p-norm regression problem is a classic problem in optimization
wit...
We present a very simple and intuitive algorithm to find balanced sparse...
In this article, we present the first deterministic directed Laplacian L...
In this article, we show that the algorithm of maintaining expander
deco...
We give an algorithm that computes exact maximum flows and minimum-cost ...
We study linear equations in combinatorial Laplacians of k-dimensional
s...
We give a nearly-linear time reduction that encodes any linear program a...
We present new scalar and matrix Chernoff-style concentration bounds for...
Given a directed, weighted graph G=(V,E) undergoing edge insertions, the...
We improve the current best running time value to invert sparse matrices...
We prove lower bounds for higher-order methods in smooth non-convex
fini...
We give almost-linear-time algorithms for constructing sparsifiers with ...
We present algorithms for solving a large class of flow and regression
p...
We give improved algorithms for the ℓ_p-regression problem, _xx_p such t...
We prove a matrix discrepancy bound that strengthens the famous
Kadison-...
We show how to solve directed Laplacian systems in nearly-linear time. G...
Strongly Rayleigh distributions are a class of negatively dependent
dist...
We present an asymptotically faster algorithm for solving linear systems...
We show that if the nearly-linear time solvers for Laplacian matrices an...