Deterministic approximation of the cover time
Random Structures & Algorithms
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Expansion and the cover time of parallel random walks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The cover time of deterministic random walks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Tight bounds for the cover time of multiple random walks
Theoretical Computer Science
Cover times, blanket times, and majorizing measures
Proceedings of the forty-third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |