Search
-
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 -
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