Walter J. Savitch

32 papers A* 5A 2Journal 19Unranked 3
YearRankTypeTitle / Venue / Authors
2011 — ch.
The Software Side of Computer Science - Computer Programming.
Computer Science, The Hardware, Software and Heart of It
Edward K. Blum, Walter J. Savitch
2001 A conf
Writing a textbook: walking the gauntlet.
SIGCSE
Nell B. Dale, Rick Mercer, Elliot B. Koffman, Walter J. Savitch
1995 J jnl
An occurrence-based model of word categorization.
Ann. Math. Artif. Intell.
P. A. Bensch, Walter J. Savitch
1995 — book
Data structures and other objects - Turbo Pascal edition.
Michael Main, Walter J. Savitch
1995 — book
Problem solving with C++ - the object of programming.
Walter J. Savitch
1994 A conf
Teaching Ada by the book: the pedagogy of Ada in CS1.
SIGCSE
John W. McCormick, Fintan Culwin, Nicholas J. DeLillo, Michael B. Feldman, Richard E. Pattis, Walter J. Savitch
1993 J jnl
Why it Might Pay to Assume That Languages are infinite.
Ann. Math. Artif. Intell.
Walter J. Savitch
1989 J jnl
A Formal Model for Context-Free Languages Augmented with Reduplication.
Comput. Linguistics
Walter J. Savitch
1984 J jnl
Consistency in Nondeterministic Storage.
J. Comput. Syst. Sci.
Walter J. Savitch, Patrick W. Dymond
1984 J jnl
On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps.
Inf. Process. Lett.
Walter J. Savitch, Paul M. B. Vitányi
1983 J jnl
A Note on Relativized Log Space.
Math. Syst. Theory
Walter J. Savitch
1982 J jnl
Parallel Random Access Machines with Powerful Instruction Sets.
Math. Syst. Theory
Walter J. Savitch
1981 J jnl
On the amount of non-determinism in pushdown in pushdown automata.
Fundam. Informaticae
Dirk Vermeir, Walter J. Savitch
1980 J jnl
Growth Functions of Stochastic Lindenmayer Systems
Inf. Control.
Peter Eichhorst, Walter J. Savitch
1979 J jnl
Programs for Instruction Machines
Inf. Control.
Zdzislaw Pawlak, Grzegorz Rozenberg, Walter J. Savitch
1979 J jnl
Time Bounded Random Access Machines with Parallel Processing.
J. ACM
Walter J. Savitch, Michael J. Stimson
1978 — conf
Graphs of Processors.
Graph-Grammars and Their Application to Computer Science and Biology
Walter J. Savitch
1978 J jnl
On Inverse Deterministic Pushdown Transductions.
J. Comput. Syst. Sci.
Paul M. B. Vitányi, Walter J. Savitch
1978 A* conf
Parallel and Nondeterministic Time Complexity Classes (Preliminary Report).
ICALP
Walter J. Savitch
1978 A* ed.
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA
STOC
Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho
1977 A* conf
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps.
ICALP
Walter J. Savitch, Paul M. B. Vitányi
1975 J jnl
Ambiguity in the Developmental Systems of Lindenmayer.
J. Comput. Syst. Sci.
Ann Reedy, Walter J. Savitch
1975 — conf
Ambiguous Developmental Plans.
Automata, Languages, Development
Walter J. Savitch
1975 — conf
Computational Complexity of Developmental Programs.
Automata, Languages, Development
Walter J. Savitch
1975 J jnl
Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines
Inf. Control.
Walter J. Savitch
1975 J jnl
The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages.
Theor. Comput. Sci.
Ann Reedy, Walter J. Savitch
1973 J jnl
A Note on Multihead Automata and Context-Sensitive Languages
Acta Informatica
Walter J. Savitch
1973 J jnl
How to Make Arbitrary Grammars Look Like Context-Free Grammars.
SIAM J. Comput.
Walter J. Savitch
1973 J jnl
Maze Recognizing Automata and Nondeterministic Tape Complexity.
J. Comput. Syst. Sci.
Walter J. Savitch
1972 A* conf
Maze Recognizing Automata (Extended Abstract)
STOC
Walter J. Savitch
1970 J jnl
Relationships Between Nondeterministic and Deterministic Tape Complexities.
J. Comput. Syst. Sci.
Walter J. Savitch
1969 A* conf
Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract)
STOC
Walter J. Savitch