Recherche
-
Approximation bounds for Black Hole Search problems
Communication dans un congrès -
Searching for black-hole faults in a network using multiple agents
Communication dans un congrès -
Lower Bounds and Algorithms for Dominating Sets in Web Graphs
(Internet Mathematics. vol. 2, n° 3, pp. 275--300, 2005)Article de revue -
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
(Springer-Verlag, 2005)Ouvrage -
[Sans titre]
(2014-06-09)Document de travail - Pré-publication -
Algorithmic Methods for Large Communication Networks
Autre document -
On the size of identifying codes in triangle-free graphs
(Discrete Applied Mathematics. vol. 160, n° 10-11, pp. 1532-1546, 2012-07-01)Article de revue -
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 -
Fast Generation and Mixing of Random Graphs in Peer-to-Peer Networks
(2011-10-01)Document de travail - Pré-publication