Recherche
-
On the Communication Complexity of Distributed Name-Independent Routing Schemes
Communication dans un congrès -
Algorithme distribué de routage compact en temps optimal
Communication dans un congrès -
Simulations de routage du schéma AGMaNT
Autre document -
Path Separability of Graphs
(2010-08)Document de travail - Pré-publication -
On Space-Stretch Trade-Offs: Upper Bounds
Communication dans un congrès -
On the Tree-Width of Planar Graphs
Communication dans un congrès -
Local Computation of Nearly Additive Spanners
Communication dans un congrès -
What Can be Observed Locally? Round-based Models for Quantum Distributed Computing
Communication dans un congrès -
On the Path Separability of Planar Graphs
Communication dans un congrès -
Distributed computing with advice: information sensitivity of graph coloring
(Distributed Computing. vol. 21, n° 6, pp. 395-403, 2009-03)Article de revue