1 citations · 1 across the 4 of their papers we have counts for
4 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…
A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory
Michael Feldmann, Thorsten Götte, Christian Scheideler
We consider congestion control in peer-to-peer distributed systems. The problem can be reduced to the following scenario: Consider a set of peers (called clients in this pa…