On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The evolution of the cover time
Combinatorics, Probability and Computing
The cover time of cartesian product graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Cover times, blanket times, and majorizing measures
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |