We propose and analyze a quasirandom analogue of the classical push model for
disseminating information in networks (" randomized rumor spreading"). In the classical …

A rotor walk in a directed graph can be thought of as a deterministic version of a Markov
Chain, where a pebble moves from vertex to vertex following a simple rule until a terminal …

We study the parallel rotor walk process, which works as follows: Consider a graph along
with an arbitrary distribution of tokens over its nodes. Every node is equipped with a rotor …

The rotor-router mechanism was introduced as a deterministic alternative to the random
walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel …

We revisit the design of self-adjusting single-source tree networks. The problem can be seen
as a generalization of the classic list update problem to trees, and finds applications in …

We study the cover time of multiple walks in a graph following the rotor-router mechanism.
This mechanism can be seen as a derandomization of multiple random walks, in which …

We consider the problem of deterministic load balancing of tokens in the discrete model. A
set of n processors is connected into ad-regular undirected network. In every timestep, each …

We propose and analyze a quasirandom analogue of the classical push model for
disseminating information in networks (“randomized rumor spreading”). In the classical …

The rotor‐router model, also known as the Propp machine, is a deterministic process
analogous to a random walk on a graph. Instead of distributing tokens to randomly chosen …

We give an algorithm that computes the final state of certain growth models without
computing all intermediate states. Our technique is based on a “least action principle” which …