W. Savitch. Maze recognizing automata and nondeterministic tape complexity. JCSS, 7:389-403, 1973. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
A Short History of Computational Complexity - Fortnow, Homer (2002) (Correct)
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets - Cai, Sivakumar (1995) (3 citations) (Correct)
A Perspective on Lindström Quantifiers and Oracles - Stewart (Correct)
On the Complexity of the st-Connectivity Problem - Poon (1996) (Correct)
Probabilistic Techniques In Structural Complexity Theory - Sivakumar (1996) (1 citation) (Correct)
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets - Cai, Sivakumar (1995) (3 citations) (Correct)
Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
Deterministic and Randomized Bounded Truth-table Reductions of .. - van Melkebeek (1996) (Correct)
The Power of Team Exploration: Two Robots Can Learn Unlabeled .. - Bender, Slonim (1994) (25 citations) (Correct)
Deterministic and Randomized Bounded Truth-table Reductions of .. - van Melkebeek (Correct)
The Power of Team Exploration: Two Robots Can Learn Unlabeled .. - Bender, Slonim (1994) (25 citations) (Correct)
Time-Space Tradeoffs for Undirected Graph Traversal - Beame, Borodin, Raghavan.. (1993) (5 citations) (Correct)
Time-Space Lower Bounds For Directed st-Connectivity On Graph .. - Barnes, Edmonds (1998) (9 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