The hitting and cover times of random walks on finite graphs using local degree information

Random walks, universal traversal sequences, and the complexity of maze problems

Romas Aleliunas, Richard M. Karp, Richard J. Lipton et al. · 1979 · 705 citations

Computing, Computer Science, Mathematics +15

Token management schemes and random walks yield self-stabilizing mutual exclusion

Amos Israeli, Marc Jalfon · 1990 · 246 citations · Full text

Computing, Computer Engineering, Computer Science +9

A tight lower bound on the cover time for random walks on graphs

Uriel Feige · Random Structures and Algorithms · 1995 · 197 citations

Natural Sciences, Computer Science, Mathematics +14

Collisions Among Random Walks on a Graph

Don Coppersmith, Prasad Tetali, Peter Winkler · SIAM Journal on Discrete Mathematics · 1993 · 171 citations

Engineering, Computer Science, Algorithms +12

Maximum hitting time for random walks on graphs

Graham Brightwell, Peter Winkler · Random Structures and Algorithms · 1990 · 126 citations

Natural Sciences, Computer Science, Mathematics +15