1 citations · 2 across the 4 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DC2026
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…
cs.DS2026
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…