Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Measuring index quality using random walks on the Web
WWW '99 Proceedings of the eighth international conference on World Wide Web
Towards Compressing Web Graphs
DCC '01 Proceedings of the Data Compression Conference
Random Evolution in Massive Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The cover time of sparse random graphs.
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Random Structures & Algorithms
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Multiple-goal heuristic search
Journal of Artificial Intelligence Research
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |