Recherche
-
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
Communication dans un congrès -
Maximum matching in multi-interface networks
(Theoretical Computer Science. vol. 507, pp. 52-60, 2013)Article de revue -
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains
(Theory of Computing Systems. vol. 52, n° 2, pp. 179-199, 2013)Article de revue -
Locating a Target with an Agent Guided by Unreliable Local Advice
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 -
Comment battre la marche aléatoire en comptant ?
Communication dans un congrès -
[Sans titre]
(2014-06-09)Document de travail - Pré-publication -
How to meet when you forget: log-space rendezvous in arbitrary graphs
(Distributed Computing. vol. 25, n° 2, pp. 165-178, 2012)Article de revue -
Graph Decomposition for Memoryless Periodic Exploration
(Algorithmica. vol. 63, n° 1-2, pp. 26-38, 2012)Article de revue