5 citations · 6 across the 5 of their papers we have counts for
5 papers
An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
Antoine El-Hayek, Robert Elsässer, Stefan Schmid
We revisit the majority problem in the population protocol communication model, as first studied by Angluin et al. (Distributed Computing 2008). We consider a more general version…
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.…
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…
Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion
Hoda Akbari, Petra Berenbrink, Robert Elsässer +1
In this paper we consider a wide class of discrete diffusion load balancing algorithms. The problem is defined as follows. We are given an interconnection network and a number of l…
On the Influence of Graph Density on Randomized Gossiping
Robert Elsässer, Dominik Kaaser
Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, the broadcasting problem, a message has to be spread among all no…