15 citations · 41 across the 23 of their papers we have counts for
3 papers · 1 filter
Self-stabilizing Balls & Bins in Batches
Petra Berenbrink, Tom Friedetzky, Peter Kling +3
A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modeled…
Bounds on the Voter Model in Dynamic Networks
Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec +1
In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the cons…
Plurality Consensus via Shuffling: Lessons Learned from Load Balancing
Petra Berenbrink, Tom Friedetzky, Peter Kling +2
We consider \emph{plurality consensus} in a network of nodes. Initially, each node has one of opinions. The nodes execute a (randomized) distributed protocol to agree on th…