15 citations · 29 across the 15 of their papers we have counts for
13 papers · 1 filter
(Almost) Perfect Discrete Iterative Load Balancing
Petra Berenbrink, Robert Elsässer, Tom Friedetzky +4
We consider discrete, iterative load balancing via matchings on arbitrary graphs. Initially each node holds a certain number of tokens, defining the load of the node, and the objec…
Balls and Bins and the Infinite Process with Random Deletions
Petra Berenbrink, Tom Friedetzky, Peter Kling +1
We consider an infinite balls-into-bins process with deletions where in each discrete step a coin is tossed as to whether, with probability , a new ball is allo…
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…
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
Jannik Castenow, Jonas Harbig, Daniel Jung +3
We consider a swarm of robots in \mathbb{R}^d. The robots are oblivious, disoriented (no common coordinate system/compass), and have limited visibility (observe other robots up…
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 Discrete and Continuous Study of the Max-Chain-Formation Problem
Jannik Castenow, Peter Kling, Till Knollmann +1
Most existing robot formation problems seek a target formation of a certain \emph{minimal} and, thus, efficient structure. Examples include the Gathering and the Chain-Formation pr…