93 citations · 537 across the 73 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.DS2011
Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs
Guy E. Blelloch, Anupam Gupta, Ioannis Koutis +3
We present the design and analysis of a near linear-work parallel algorithm for solving symmetric diagonally dominant (SDD) linear systems. On input of a SDD -by- matrix …
cs.DS2011★ 4 cited
Runtime Guarantees for Regression Problems
Hui Han Chin, Aleksander Madry, Gary Miller +1
We study theoretical runtime guarantees for a class of optimization problems that occur in a wide variety of inference problems. these problems are motivated by the lasso framework…
cs.DS2011★ 93 cited
A nearly-mlogn time solver for SDD linear systems
Ioannis Koutis, Gary Miller, Richard Peng
We present an improved algorithm for solving symmetrically diagonally dominant linear systems. On input of an symmetric diagonally dominant matrix with non-zero…