36 citations · 118 across the 28 of their papers we have counts for
5 papers · 1 filter
Quasirandom Rumor Spreading: An Experimental Analysis
Benjamin Doerr, Tobias Friedrich, Marvin Künnemann +1
We empirically analyze two versions of the well-known "randomized rumor spreading" protocol to disseminate a piece of information in networks. In the classical model, in each round…
Quasirandom Rumor Spreading
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
We propose and analyze a quasirandom analogue of the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical model, in each…
The Cover Time of Deterministic Random Walks
Tobias Friedrich, Thomas Sauerwald
The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examin…
Smoothed Analysis of Balancing Networks
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
In a balancing network each processor has an initial collection of unit-size jobs (tokens) and in each round, pairs of processors connected by balancers split their load as evenly…
Quasirandom Load Balancing
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random a…