R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lov'asz, and C. Rackoff. "Random walks, universal traversal sequences, and the complexity of maze problems". In 20th Annual Symposium on Foundations of Computer Science, pages 218--223, San Juan, Puerto Rico, October 1979. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Random Walks on Regular and Irregular Graphs - Coppersmith, Feige, Shearer (1993) (4 citations) (Correct)
A Fast Randomized LOGSPACE Algorithm for Graph Connectivity - Feige (1996) (4 citations) (Correct)
A Tight Lower Bound on the Cover Time for Random Walks on Graphs - Feige (2000) (12 citations) (Correct)
A Spectrum of Time-Space Tradeoffs for Undirected s-t Connectivity - Feige (1996) (Correct)
Deterministic Approximation of the Cover Time - Feige, Rabinovich (Correct)
A Tight Upper Bound on the Cover Time for Random Walks on Graphs - Feige (1995) (16 citations) (Correct)
Bounds On The Cover Time - Broder, Karlin (1988) (19 citations) (Correct)
Principles And Methods Of Testing Finite State Machines - A.. - Lee, Yannakakis (1996) (64 citations) (Correct)
ANTS: Agents, Networks, Trees, and Subgraphs - Wagner, Lindenbaum, Bruckstein (1999) (Correct)
Simple Algorithms for Hot-Potato Routing - Krauthgamer (1996) (Correct)
MAC vs. PC - Determinism and Randomness as.. - Wagner, Lindenbaum.. (1998) (1 citation) (Correct)
Collecting Coupons on Trees, and the Analysis of Random Walks - Feige (1994) (Correct)
Robotic Exploration, Brownian Motion and Electrical.. - Wagner, Lindenbaum.. (1998) (Correct)
Cooperative Covering by Ant-Robots using Evaporating Traces - Wagner, Lindenbaum.. (1996) (Correct)
On the Random Walk Method for Protocol Testing - Mihail, Papadimitriou (1994) (8 citations) (Correct)
A Tight Lower Bound on the Cover Time for Random Walks on Graphs - Feige (1994) (12 citations) (Correct)
Efficiently Searching a Graph by a Smell-Oriented Vertex .. - Wagner, Lindenbaum.. (Correct)
Reachability and the Power of Local Ordering - Etessami, Immerman (1994) (2 citations) (Correct)
Reachability and the Power of Local Ordering - Etessami, Immermann (1994) (2 citations) (Correct)
Languages That Capture Complexity Classes - Immerman (1987) (189 citations) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC