Buscar
-
More efficient periodic traversal in anonymous undirected graphs
(Theoretical Computer Science. vol. 444, pp. pages 60-76, 2012-07)Article de revue -
Gathering of Robots on Anonymous Grids without multiplicity detection
Communication dans un congrès -
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles
(Algorithmica. vol. 62, n° 3-4, pp. pages 1006-1033, 2012-04)Article de revue -
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 -
Taking advantage of hybrid systems for sparse direct solvers via task-based runtimes
Communication dans un congrès