Peter Maxwell Davies

most citedImproved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DC2022★ 2 cited

Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring

Peter Davies

The Lovász Local Lemma is a classic result in probability theory that is often used to prove the existence of combinatorial objects via the probabilistic method. In its simplest fo…

cs.DS2021

Improved Deterministic $(Δ + 1)$ -Coloring in Low-Space MPC

Artur Czumaj, Peter Davies, Merav Parter

We present a deterministic $O (lo g lo g lo g n)$ -round low-space Massively Parallel Computation (MPC) algorithm for the classical problem of $(Δ + 1)$ -coloring on $n$ -vertex graphs.…

cs.DC2021

Collecting Coupons is Faster with Friends

Dan Alistarh, Peter Davies

In this note, we introduce a distributed twist on the classic coupon collector problem: a set of $m$ collectors wish to each obtain a set of $n$ coupons; for this, they can each sa…

Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring

Improved Deterministic (Δ+1)-Coloring in Low-Space MPC

Collecting Coupons is Faster with Friends

Improved Deterministic $(Δ + 1)$ -Coloring in Low-Space MPC