Time versus cost tradeoffs for deterministic rendezvous in networks

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

Undirected connectivity in log-space

Omer Reingold · Journal of the ACM · 2008 · 511 citations

Computing, Computer Science, Mathematics +16

Approximation Algorithms for Some Routing Problems

Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim · SIAM Journal on Computing · 1978 · 420 citations

Computing, Computer Science, Algorithms +16

Gathering of asynchronous robots with limited visibility

Paola Flocchini, Giuseppe Prencipe, Nicola Santoro et al. · Theoretical Computer Science · 2005 · 396 citations

Engineering, Computer Science, Robotics Engineering +7

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