Recherche
-
Derandomizing random walks in undirected graphs using locally fair exploration strategies
(Distributed Computing. vol. 24, n° 2, pp. 91-99, 2011)Article de revue -
How many oblivious robots can explore a line
(Information Processing Letters. vol. 111, n° 20, pp. 1027-1031, 2011-10-31)Article de revue -
Synchronous Black Hole Search in Directed Graphs
(Theoretical Computer Science. vol. 412, n° 41, pp. 5752-5759, 2011-06-13)Article de revue -
On the Locality of Distributed Sparse Spanner Construction
Communication dans un congrès -
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Communication dans un congrès -
Constructing Incremental Sequences in Graphs
(Algorithmic Operations Research. vol. 1, n° 2, pp. 1--7, 2006)Article de revue -
Fast Radio Broadcasting with Advice
Communication dans un congrès -
Memoryless search algorithms in a network with faulty advice
(Theoretical Computer Science. vol. 402, n° 2-3, pp. 190-198, 2008)Article de revue -
A view selection algorithm with performance guarantee
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