Recherche
-
Time versus space trade-offs for rendezvous in trees
(Distributed Computing. vol. 27, n° 2, pp. 95-109, 2014-04)Article de revue -
Optimal Patrolling of Fragmented Boundaries
Communication dans un congrès -
Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network
(Université Sciences et Technologies - Bordeaux I)HDR -
Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice
Communication dans un congrès -
Fast Collaborative Graph Exploration
Communication dans un congrès -
Position Discovery for a System of Bouncing Robots
Communication dans un congrès -
Maximum Matching in Multi-Interface Networks
Communication dans un congrès -
Time vs. space trade-offs for rendezvous in trees
Communication dans un congrès -
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