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 -
Dynamic Load Balancing with Pair Potentials
Communication dans un congrès -
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 -
Puissance de l'attente aux stations pour l'exploration des réseaux de transport public
Communication dans un congrès -
Static Mapping of Process Graphs
(ISTE - Wiley, 2011-09-01)Chapitre d'ouvrage -
Parallelization of Graph Partitioning
(ISTE - Wiley, 2011-09-01)Chapitre d'ouvrage -
Network Verification via Routing Table Queries
Communication dans un congrès -
Derandomizing random walks in undirected graphs using locally fair exploration strategies
(Distributed Computing. vol. 24, n° 2, pp. 91-99, 2011)Article de revue