Recherche
-
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Robustness of the rotor-router mechanism
Communication dans un congrès -
Euler Tour Lock-in Problem in the Rotor-Router Model
Communication dans un congrès -
More Efficient Periodic Traversal in Anonymous Undirected Graphs
Communication dans un congrès -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Algorithmic Methods for Large Communication Networks
Autre document -
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks
(SIAM Journal on Discrete Mathematics. vol. 23, n° 3, pp. 1612--1645, 2009)Article de revue -
On the Complexity of Distributed Graph Coloring with Local Minimality Constraints
(Networks. vol. 54, n° 1, pp. 12--19, 2009-08)Article de revue -
From Balls and Bins to Points and Vertices
(Algorithmic Operations Research. vol. 4, n° 2, pp. 133--143, 2009)Article de revue