Recherche
-
Fast Deterministic Distributed Algorithms for Sparse Spanners
(Theoretical Computer Science. vol. 399, n° 1-2, pp. 83-100, 2008-02)Article de revue -
Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch
Communication dans un congrès -
Label-Guided Graph Exploration by a Finite Automaton
(ACM Transactions on Algorithms. vol. 4, n° 4, pp. Article 42, 2008-08)Article de revue -
Tree exploration with advice
(Information and Computation. vol. 206, n° 11, pp. 1276-1287, 2008-11)Article de revue -
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 -
Non-searchability of random scale-free graphs
Communication dans un congrès -
Dynamic Load Balancing with Pair Potentials
Communication dans un congrès -
High performance BLAS formulation of the multipole-to-local operator in the Fast Multipole Method
(Journal of Computational Physics. vol. 227, n° 3, pp. 1836-1862, 2008)Article de revue