3 citations · 4 across the 7 of their papers we have counts for
5 papers · 1 filter
Counting in Population Protocols on Graphs
Petra Berenbrink, Robert Elsässer, Tom Friedetzky +3
We consider the problem of counting the number of agents in a population protocol where the agents are connected by an underlying graph with nodes. In each step,…
Discrete Incremental Voting: New Bounds for General Graphs and Expanders
Petra Berenbrink, Colin Cooper, Thorsten Götte +2
We analyze the discrete incremental voting process (DIV) introduced by Cooper, Radzik, and Shiraga [OPODIS '23]. In this process, we consider a set of nodes connected in an…
A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols
Henry Austin, Petra Berenbrink, Tom Friedetzky +2
We consider the problem of self-stabilizing leader election in the population model by Angluin, Aspnes, Diamadi, Fischer, and Peralta (JDistComp '06). The population model is a wel…
Silent Self-Stabilizing Ranking: Time Optimal and Space Efficient
Petra Berenbrink, Robert Elsässer, Thorsten Götte +2
We present a silent, self-stabilizing ranking protocol for the population protocol model of distributed computing, where agents interact in randomly chosen pairs to solve a common…
Dynamic Averaging Load Balancing on Arbitrary Graphs
Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour +2
In this paper we study dynamic averaging load balancing on general graphs. We consider infinite time and dynamic processes, where in every step new load items are assigned to rando…