On mixing times for stratified walks on the d-cube
Random Structures & Algorithms
The cover time of sparse random graphs.
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic approximation of the cover time
Random Structures & Algorithms
On the Cover Time for Random Walks on Random Graphs
Combinatorics, Probability and Computing
The cover time of two classes of random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The power of choice in random walks: an empirical study
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
The cover time of the preferential attachment graph
Journal of Combinatorial Theory Series B
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
The Cover Time of Random Digraphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The hitting and cover times of random walks on finite graphs using local degree information
Theoretical Computer Science
The cover time of random geometric graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Multiple Random Walks and Interacting Particle Systems
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The Weighted Coupon Collector's Problem and Applications
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Performance of random walks in one-hop replication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Note: The hitting and cover times of Metropolis walks
Theoretical Computer Science
Impact of local topological information on random walks on finite graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
How to design a linear cover time random walk on a finite graph
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Expansion and the cover time of parallel random walks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Speeding up random walks with neighborhood exploration
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The cover time of deterministic random walks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |