2 citations · 2 across the 3 of their papers we have counts for
4 papers · 1 filter
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
Peter Davies
In the study of radio networks, the tasks of broadcasting (propagating a message throughout the network) and leader election (having the network agree on a node to designate `leade…
Optimal Message-Passing with Noisy Beeps
Peter Davies
Beeping models are models for networks of weak devices, such as sensor networks or biological networks. In these networks, nodes are allowed to communicate only via emitting beeps:…
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…
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 collectors wish to each obtain a set of coupons; for this, they can each sa…