Recherche
-
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 -
What Can be Observed Locally? Round-based Models for Quantum Distributed Computing
Communication dans un congrès -
What Can be Observed Locally? Round-based Models for Quantum Distributed Computing
(2009)Autre document -
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 -
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 -
A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity
Communication dans un congrès -
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
Communication dans un congrès