Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract) - Walter J. Savitch (STOC, 1969)

Relationships Between Nondeterministic and Deterministic Tape Complexities. - Walter J. Savitch (J. Comput. Syst. Sci., 1970)

Maze Recognizing Automata (Extended Abstract) - Walter J. Savitch (STOC, 1972)

A Note on Multihead Automata and Context-Sensitive Languages - Walter J. Savitch (Acta Informatica, 1973)

Maze Recognizing Automata and Nondeterministic Tape Complexity. - Walter J. Savitch (J. Comput. Syst. Sci., 1973)

How to Make Arbitrary Grammars Look Like Context-Free Grammars. - Walter J. Savitch (SIAM J. Comput., 1973)

Computational Complexity of Developmental Programs. - Walter J. Savitch (Automata, Languages, Development, 1975)

Ambiguous Developmental Plans. - Walter J. Savitch (Automata, Languages, Development, 1975)

Ambiguity in the Developmental Systems of Lindenmayer. - Ann Reedy; Walter J. Savitch (J. Comput. Syst. Sci., 1975)

The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages. - Ann Reedy; Walter J. Savitch (Theor. Comput. Sci., 1975)

Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines - Walter J. Savitch (Inf. Control., 1975)

Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps. - Walter J. Savitch; Paul M. B. Vitányi (ICALP, 1977)

Graphs of Processors. - Walter J. Savitch (Graph-Grammars and Their Application to Computer Science and Biology, 1978)

Parallel and Nondeterministic Time Complexity Classes (Preliminary Report). - Walter J. Savitch (ICALP, 1978)

On Inverse Deterministic Pushdown Transductions. - Paul M. B. Vitányi; Walter J. Savitch (J. Comput. Syst. Sci., 1978)

Time Bounded Random Access Machines with Parallel Processing. - Walter J. Savitch; Michael J. Stimson (J. ACM, 1979)

Programs for Instruction Machines - Zdzislaw Pawlak; Grzegorz Rozenberg; Walter J. Savitch (Inf. Control., 1979)

Growth Functions of Stochastic Lindenmayer Systems - Peter Eichhorst; Walter J. Savitch (Inf. Control., 1980)

On the amount of non-determinism in pushdown in pushdown automata. - Dirk Vermeir; Walter J. Savitch (Fundam. Informaticae, 1981)

Parallel Random Access Machines with Powerful Instruction Sets. - Walter J. Savitch (Math. Syst. Theory, 1982)

A Note on Relativized Log Space. - Walter J. Savitch (Math. Syst. Theory, 1983)

On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps. - Walter J. Savitch; Paul M. B. Vitányi (Inf. Process. Lett., 1984)

Consistency in Nondeterministic Storage. - Walter J. Savitch; Patrick W. Dymond (J. Comput. Syst. Sci., 1984)

A Formal Model for Context-Free Languages Augmented with Reduplication. - Walter J. Savitch (Comput. Linguistics, 1989)

Why it Might Pay to Assume That Languages are infinite. - Walter J. Savitch (Ann. Math. Artif. Intell., 1993)

Teaching Ada by the book: the pedagogy of Ada in CS1. - John W. McCormick; Fintan Culwin; Nicholas J. DeLillo; Michael B. Feldman; Richard E. Pattis; Walter J. Savitch (SIGCSE, 1994)

Data structures and other objects - Turbo Pascal edition. - Michael Main; Walter J. Savitch (Benjamin/Cummings, 1995)

Problem solving with C++ - the object of programming. - Walter J. Savitch (Addison-Wesley, 1995)

An occurrence-based model of word categorization. - P. A. Bensch; Walter J. Savitch (Ann. Math. Artif. Intell., 1995)

Writing a textbook: walking the gauntlet. - Nell B. Dale; Rick Mercer; Elliot B. Koffman; Walter J. Savitch (SIGCSE, 2001)

The Software Side of Computer Science - Computer Programming. - Edward K. Blum; Walter J. Savitch (Computer Science, The Hardware, Software and Heart of It, 2011)