 | 2001 |
|---|
| 26 |       | Nell B. Dale,
Rick Mercer,
Elliot B. Koffman,
Walter J. Savitch:
Writing a textbook: walking the gauntlet.
SIGCSE 2001: 408-409 |
| 1995 |
|---|
| 25 |  | P. A. Bensch,
Walter J. Savitch:
An occurrence-based model of word categorization.
Ann. Math. Artif. Intell. 14(1): (1995) |
| 1994 |
|---|
| 24 | | 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: 385-386 |
| 1993 |
|---|
| 23 | | Walter J. Savitch:
Why it Might Pay to Assume That Languages are infinite.
Ann. Math. Artif. Intell. 8(1-2): 17-25 (1993) |
| 1989 |
|---|
| 22 | | Walter J. Savitch:
A Formal Model for Context-Free Languages Augmented with Reduplication.
Computational Linguistics 15(4): 250-261 (1989) |
| 1984 |
|---|
| 21 | | 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): 31-35 (1984) |
| 20 | | Walter J. Savitch,
Patrick W. Dymond:
Consistency in Nondeterministic Storage.
J. Comput. Syst. Sci. 29(1): 118-132 (1984) |
| 1983 |
|---|
| 19 | | Walter J. Savitch:
A Note on Relativized Log Space.
Mathematical Systems Theory 16(4): 229-235 (1983) |
| 1982 |
|---|
| 18 | | Walter J. Savitch:
Parallel Random Access Machines with Powerful Instruction Sets.
Mathematical Systems Theory 15(3): 191-210 (1982) |
| 1981 |
|---|
| 17 | | Dirk Vermeir,
Walter J. Savitch:
On the amount of non-determinism in pushdown in pushdown automata.
Fundam. Inform. 4(2): 401-418 (1981) |
| 1980 |
|---|
| 16 | | Peter Eichhorst,
Walter J. Savitch:
Growth Functions of Stochastic Lindenmayer Systems
Information and Control 45(3): 217-228 (1980) |
| 1979 |
|---|
| 15 | | Zdzislaw Pawlak,
Grzegorz Rozenberg,
Walter J. Savitch:
Programs for Instruction Machines
Information and Control 41(1): 9-28 (1979) |
| 14 | | Walter J. Savitch,
Michael J. Stimson:
Time Bounded Random Access Machines with Parallel Processing.
J. ACM 26(1): 103-118 (1979) |
| 1978 |
|---|
| 13 | | Walter J. Savitch:
Graphs of Processors.
Graph-Grammars and Their Application to Computer Science and Biology 1978: 418-425 |
| 12 | | Walter J. Savitch:
Parallel and Nondeterministic Time Complexity Classes (Preliminary Report).
ICALP 1978: 411-424 |
| 11 | | Paul M. B. Vitányi,
Walter J. Savitch:
On Inverse Deterministic Pushdown Transductions.
J. Comput. Syst. Sci. 16(3): 423-444 (1978) |
| 1977 |
|---|
| 10 | | Walter J. Savitch,
Paul M. B. Vitányi:
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps.
ICALP 1977: 453-464 |
| 1975 |
|---|
| 9 | | Walter J. Savitch:
Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines
Information and Control 27(1): 37-60 (1975) |
| 8 | | Ann Reedy,
Walter J. Savitch:
Ambiguity in the Developmental Systems of Lindenmayer.
J. Comput. Syst. Sci. 11(2): 262-283 (1975) |
| 7 | | Ann Reedy,
Walter J. Savitch:
The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages.
Theor. Comput. Sci. 1(1): 77-91 (1975) |
| 1973 |
|---|
| 6 | | Walter J. Savitch:
A Note on Multihead Automata and Context-Sensitive Languages
Acta Inf. 2: 249-252 (1973) |
| 5 | | Walter J. Savitch:
Maze Recognizing Automata and Nondeterministic Tape Complexity.
J. Comput. Syst. Sci. 7(4): 389-403 (1973) |
| 4 | | Walter J. Savitch:
How to Make Arbitrary Grammars Look Like Context-Free Grammars.
SIAM J. Comput. 2(3): 174-182 (1973) |
| 1972 |
|---|
| 3 | | Walter J. Savitch:
Maze Recognizing Automata (Extended Abstract)
STOC 1972: 151-156 |
| 1970 |
|---|
| 2 | | Walter J. Savitch:
Relationships Between Nondeterministic and Deterministic Tape Complexities.
J. Comput. Syst. Sci. 4(2): 177-192 (1970) |
| 1969 |
|---|
| 1 | | Walter J. Savitch:
Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract)
STOC 1969: 247-248 |
