Recherche
-
Collision-Free Network Exploration
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 -
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 -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Brief Announcement: On the Complexity of Distributed Greedy Coloring
Communication dans un congrès -
[Sans titre]
(2014-06-09)Document de travail - Pré-publication -
On the size of identifying codes in triangle-free graphs
(Discrete Applied Mathematics. vol. 160, n° 10-11, pp. 1532-1546, 2012-07-01)Article de revue -
Derandomizing random walks in undirected graphs using locally fair exploration strategies
(Distributed Computing. vol. 24, n° 2, pp. 91-99, 2011)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