Deterministic approximation of the cover time
Random Structures & Algorithms
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
Improved approximation of the minimum cover time
Theoretical Computer Science
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
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
Expansion and the cover time of parallel random walks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The evolution of the cover time
Combinatorics, Probability and Computing
Cover times, blanket times, and majorizing measures
Proceedings of the forty-third annual ACM symposium on Theory of computing
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
| Hi-index | 0.01 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...