David G. Harris

activity

20132026

most citedBounds and algorithms for graph trusses

6 citations · 33 across the 33 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014

The Moser-Tardos Framework with Partial Resampling

David G. Harris, Aravind Srinivasan

The resampling algorithm of Moser \& Tardos is a powerful approach to develop constructive versions of the Lovász Local Lemma (LLL). We generalize this to partial resampling: when…

cs.DS2014★ 3 cited

On Computing Maximal Independent Sets of Hypergraphs in Parallel

Ioana O. Bercea, Navin Goyal, David G. Harris +1

Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Unlike the w…

math.CO2014

Distinct volume subsets

David Conlon, Jacob Fox, William Gasarch +3

Suppose that $a$ and $d$ are positive integers with $a \geq 2$ . Let $h_{a, d} (n)$ be the largest integer $t$ such that any set of $n$ points in $R^{d}$ contains a subset of $…