1 citations · 2 across the 4 of their papers we have counts for
4 papers
Triangle-Free Coloring in LOCAL via Resilient Lovász Local Lemma
Peter Davies-Peck, Xusheng Zhang
The Lovász Local Lemma (LLL) is a probabilistic tool that has been shown to be of central importance in the study of distributed algorithms. For example, the constructive LLL is kn…
Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
Peter Davies-Peck
The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL mo…
On the Locality of the Lovász Local Lemma
Peter Davies-Peck
The Lovász Local Lemma is a versatile result in probability theory, characterizing circumstances in which a collection of `bad events', each occurring with probability at most…
Parallel Derandomization for Coloring
Sam Coy, Artur Czumaj, Peter Davies +1
Graph coloring problems are among the most fundamental problems in parallel and distributed computing, and have been studied extensively in both settings. In this context, designin…