2 citations · 2 across the 5 of their papers we have counts for
6 papers · 1 filter
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…
Asynchronous 3-Majority Dynamics with Many Opinions
Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik +2
We consider 3-Majority, a probabilistic consensus dynamics on a complete graph with vertices, each vertex starting with one of initial opinions. At each discrete time step,…
On Counting the Population Size
Petra Berenbrink, Dominik Kaaser, Tomasz Radzik
We consider the problem of counting the population size in the population model. In this model, we are given a distributed system of identical agents which interact in pairs wi…
A population protocol for exact majority with stabilization time and asymptotically optimal number of states
Petra Berenbrink, Robert Elsässer, Tom Friedetzky +3
A population protocol can be viewed as a sequence of pairwise interactions of agents (nodes). During one interaction, two agents selected uniformly at random update their state…
Time-space Trade-offs in Population Protocols for the Majority Problem
Petra Berenbrink, Robert Elsässer, Tom Friedetzky +3
Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of identical agents (finite state machines) performs a global…
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time
Andreas Bilke, Colin Cooper, Robert Elsaesser +1
We consider the model of population protocols, which can be viewed as a sequence of random pairwise interactions of agents (nodes). We show population protocols for two problem…