6 citations · 12 across the 5 of their papers we have counts for
5 papers
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…
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion
Gregor Bankhamer, Robert Elsässer, Stefan Schmid
To ensure high availability, datacenter networks must rely on local fast rerouting mechanisms that allow routers to quickly react to link failures, in a fully decentralized manner.…
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…
Local Fast Rerouting with Low Congestion: A Randomized Approach
Gregor Bankhamer, Robert Elsässer, Stefan Schmid
Most modern communication networks include fast rerouting mechanisms, implemented entirely in the data plane, to quickly recover connectivity after link failures. By relying on loc…
Positive Aging Admits Fast Asynchronous Plurality Consensus
Gregor Bankhamer, Robert Elsässer, Dominik Kaaser +1
We study distributed plurality consensus among nodes, each of which initially holds one of opinions. The goal is to eventually agree on the initially dominant opinion. We c…