Buscar
-
Efficient Exploration of Anonymous Undirected Graphs
Communication dans un congrès -
Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings
(Springer Verlag, 2012-06)Ouvrage -
Gathering radio messages in the path
(Discrete Mathematics, Algorithms and Applications. vol. 5, n° 1, pp. 1-28, 2013-03)Article de revue -
Collision-Free Network Exploration
Communication dans un congrès -
More efficient periodic traversal in anonymous undirected graphs
(Theoretical Computer Science. vol. 444, pp. pages 60-76, 2012-07)Article de revue -
Gathering of Robots on Anonymous Grids without multiplicity detection
Communication dans un congrès -
The Multi-Agent Rotor-Router on the Ring: A Deterministic Alternative to Parallel Random Walks
Communication dans un congrès -
Cost Minimization in Multi-Interface Networks
Communication dans un congrès -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Taking Advantage of Symmetries: Gathering of many Asynchronous Oblivious Robots on a Ring
(Theoretical Computer Science. vol. 411, n° 34--36, pp. 3235--3246, 2010-07)Article de revue