G. Miller

activity

20092020

most citedA nearly-mlogn time solver for SDD linear systems

93 citations · 253 across the 24 of their papers we have counts for

collaborators

Showing 2010 · cs.DSShow all

3 papers · 2 filters

cs.DS2010★ 15 cited

Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning

Mihail N. Kolountzakis, Gary L. Miller, Richard Peng +1

The number of triangles is a computationally expensive graph statistic which is frequently used in complex network analysis (e.g., transitivity ratio), in various random graph mode…

cs.DS2010

Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge decomposition

Gary L. Miller, Richard Peng, Russell Schwartz +1

Let $P = (P_{1}, P_{2}, \dots, P_{n})$ , $P_i \in \field{R}$ for all $i$ , be a signal and let $C$ be a constant. In this work our goal is to find a function $F:[n]\rightarrow \field{R}$ wh…

cs.DS2010★ 72 cited

Approaching optimality for solving SDD systems

Ioannis Koutis, Gary L. Miller, Richard Peng

We present an algorithm that on input of an $n$ -vertex $m$ -edge weighted graph $G$ and a value $k$ , produces an {\em incremental sparsifier} $G^$ with $n - 1 + m / k$ edges, such…