15 citations · 41 across the 23 of their papers we have counts for
31 papers
(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…
Fast Convergence of -Opinion Undecided State Dynamics in the Population Protocol Model
Talley Amir, James Aspnes, Petra Berenbrink +4
We analyze the convergence of the -opinion Undecided State Dynamics (USD) in the population protocol model. For =2 opinions it is well known that the USD reaches consensus wi…
Dynamic Averaging Load Balancing on Arbitrary Graphs
Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour +2
In this paper we study dynamic averaging load balancing on general graphs. We consider infinite time and dynamic processes, where in every step new load items are assigned to rando…
Distributed Averaging in Opinion Dynamics
Petra Berenbrink, Colin Cooper, Cristina Gava +4
We consider two simple asynchronous opinion dynamics on arbitrary graphs where every node has an initial value . In the first process, the NodeModel, at each time step…