Recherche
-
Setting port numbers for fast graph exploration
(Theoretical Computer Science. vol. 401, n° 1-3, pp. 236-242, 2008-07)Article de revue -
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
Communication dans un congrès -
Impact of memory size on graph exploration capability
(Discrete Applied Mathematics. vol. 156, n° 12, pp. 2310-2319, 2008-06)Article de revue -
Puissance de l'attente aux stations pour l'exploration des réseaux de transport public
Communication dans un congrès -
On the Power of Waiting when Exploring Public Transportation Systems
Communication dans un congrès -
Asynchronous deterministic rendezvous in bounded terrains
(Theoretical Computer Science. vol. 412, n° 50, pp. 6926-6937, 2011-11)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 -
How many oblivious robots can explore a line
(Information Processing Letters. vol. 111, n° 20, pp. 1027-1031, 2011-10-31)Article de revue -
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Communication dans un congrès -
Fast Radio Broadcasting with Advice
Communication dans un congrès