5 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DS2013
Fully Dynamic -Approximate Matchings
Manoj Gupta, Richard Peng
We present the first data structures that maintain near optimal maximum cardinality and maximum weighted matchings on sparse graphs in sublinear time per update. Our main result is…
cs.DS2012★ 5 cited
Iterative Row Sampling
Mu Li, Gary L. Miller, Richard Peng
There has been significant interest and progress recently in algorithms that solve regression problems involving tall and thin matrices in input sparsity time. These algorithms fin…
cs.DS2012★ 1 cited
Approximate Maximum Flow on Separable Undirected Graphs
Gary Miller, Richard Peng
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a…