M. Sipser, "Halting space-bounded computations," Theoretical Computer Science, 10: 335-338, 1980. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Space-Efficient Reversible Simulations - Williams (2000) (Correct)
Time and Space Bounds for Reversible Simulation - Buhrman (2001) (2 citations) (Correct)
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (7 citations) (Correct)
New Results on Alternating and Non-Deterministic.. - Kari, Moore (2001) (1 citation) (Correct)
Rectangles and Squares Recognized By Two-Dimensional Automata - Kari, Moore (Correct)
Space-Efficient Deterministic Simulation of Probabilistic Automata - Macarie (1993) (14 citations) (Correct)
Reversible Space Equals Deterministic Space - Lange, McKenzie, Tapp (1998) (9 citations) (Correct)
The Complexity World below Logarithmic Space - Maciej Liskiewicz, Rüdiger.. (Correct)
Computing with Sublogarithmic Space - Maciej Liskiewicz, Rüdiger Reischuk (1997) (3 citations) (Correct)
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (1997) (7 citations) (Correct)
Reversible Space Equals Deterministic Space (Extended.. - Lange, McKenzie, Tapp (Correct)
The Sublogarithmic Alternating Space World - Liskiewicz, Reischuk (1996) (Correct)
Reversible Simulation of Irreversible Computation - Li, Tromp, Vitanyi (1996) (7 citations) (Correct)
Characterization of Realizable Space Complexities - Seiferas, Meyer (1994) (3 citations) (Correct)
The Complexity World below Logarithmic Space - Liskiewicz, Reischuk (1994) (Correct)
Space Bounded Computations: Review And New Separation Results - Ranjan, Chang, Hartmanis (1991) (3 citations) (Correct)
Access Complexity - Williams (2001) (Correct)
The Generalized Shortest Path Problem - Batagelj, Brandenburg, al. (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