22 citations · 70 across the 13 of their papers we have counts for
15 papers
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,…
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…
Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions
Gregor Bankhamer, Petra Berenbrink, Felix Biermeier +4
We consider the \emph{exact plurality consensus} problem for \emph{population protocols}. Here, anonymous agents start each with one of opinions. Their goal is to agree on…
Generating Simple Directed Social Network Graphs for Information Spreading
Christoph Schweimer, Christine Gfrerer, Florian Lugstein +4
Online social networks are a dominant medium in everyday life to stay in contact with friends and to share information. In Twitter, users can connect with other users by following…
Fast Consensus via the Unconstrained Undecided State Dynamics
Gregor Bankhamer, Petra Berenbrink, Felix Biermeier +4
We consider the plurality consensus problem among agents. Initially, each agent has one of different opinions. Agents choose random interaction partners and revise their st…
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…