Walter J. Savitch

Publication Activity (10 Years)

Years Active: 1969-2001
Publications (10 Years): 0

Publications

Nell B. Dale, Rick Mercer, Elliot B. Koffman, Walter J. Savitch
Writing a textbook: walking the gauntlet. SIGCSE (2001)
P. A. Bensch, Walter J. Savitch
An occurrence-based model of word categorization. Ann. Math. Artif. Intell. 14 (1) (1995)
John W. McCormick, Fintan Culwin, Nicholas J. DeLillo, Michael B. Feldman, Richard E. Pattis, Walter J. Savitch
Teaching Ada by the book: the pedagogy of Ada in CS1. SIGCSE (1994)
Walter J. Savitch
Why it Might Pay to Assume That Languages are infinite. Ann. Math. Artif. Intell. 8 (1-2) (1993)
Walter J. Savitch
A Formal Model for Context-Free Languages Augmented with Reduplication. Comput. Linguistics 15 (4) (1989)
Walter J. Savitch, Paul M. B. Vitányi
On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps. Inf. Process. Lett. 19 (1) (1984)
Walter J. Savitch, Patrick W. Dymond
Consistency in Nondeterministic Storage. J. Comput. Syst. Sci. 29 (1) (1984)
Walter J. Savitch
A Note on Relativized Log Space. Math. Syst. Theory 16 (4) (1983)
Walter J. Savitch
Parallel Random Access Machines with Powerful Instruction Sets. Math. Syst. Theory 15 (3) (1982)
Dirk Vermeir, Walter J. Savitch
On the amount of non-determinism in pushdown in pushdown automata. Fundam. Informaticae 4 (2) (1981)
Peter Eichhorst, Walter J. Savitch
Growth Functions of Stochastic Lindenmayer Systems Inf. Control. 45 (3) (1980)
Zdzislaw Pawlak, Grzegorz Rozenberg, Walter J. Savitch
Programs for Instruction Machines Inf. Control. 41 (1) (1979)
Walter J. Savitch, Michael J. Stimson
Time Bounded Random Access Machines with Parallel Processing. J. ACM 26 (1) (1979)
Paul M. B. Vitányi, Walter J. Savitch
On Inverse Deterministic Pushdown Transductions. J. Comput. Syst. Sci. 16 (3) (1978)
Walter J. Savitch
Graphs of Processors. Graph-Grammars and Their Application to Computer Science and Biology (1978)
Walter J. Savitch
Parallel and Nondeterministic Time Complexity Classes (Preliminary Report). ICALP (1978)
Walter J. Savitch, Paul M. B. Vitányi
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps. ICALP (1977)
Walter J. Savitch
Computational Complexity of Developmental Programs. Automata, Languages, Development (1975)
Ann Reedy, Walter J. Savitch
The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages. Theor. Comput. Sci. 1 (1) (1975)
Walter J. Savitch
Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines Inf. Control. 27 (1) (1975)
Walter J. Savitch
Ambiguous Developmental Plans. Automata, Languages, Development (1975)
Ann Reedy, Walter J. Savitch
Ambiguity in the Developmental Systems of Lindenmayer. J. Comput. Syst. Sci. 11 (2) (1975)
Walter J. Savitch
A Note on Multihead Automata and Context-Sensitive Languages Acta Informatica 2 (1973)
Walter J. Savitch
How to Make Arbitrary Grammars Look Like Context-Free Grammars. SIAM J. Comput. 2 (3) (1973)
Walter J. Savitch
Maze Recognizing Automata and Nondeterministic Tape Complexity. J. Comput. Syst. Sci. 7 (4) (1973)
Walter J. Savitch
Maze Recognizing Automata (Extended Abstract) STOC (1972)
Walter J. Savitch
Relationships Between Nondeterministic and Deterministic Tape Complexities. J. Comput. Syst. Sci. 4 (2) (1970)
Walter J. Savitch
Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract) STOC (1969)