Walter J. Savitch

According to our database1, Walter J. Savitch
  • authored at least 29 papers between 1969 and 2011.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2011
The Software Side of Computer Science - Computer Programming.
Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2001
Writing a textbook: walking the gauntlet.
Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

1995
An occurrence-based model of word categorization.
Ann. Math. Artif. Intell., 1995

Problem solving with C++ - the object of programming.
Addison-Wesley, ISBN: 978-0-8053-7440-7, 1995

Data structures and other objects - Turbo Pascal edition.
Benjamin/Cummings, ISBN: 978-0-8053-7086-7, 1995

1994
Teaching Ada by the book: the pedagogy of Ada in CS1.
Proceedings of the 25th SIGCSE Technical Symposium on Computer Science Education, 1994

1993
Why it Might Pay to Assume That Languages are infinite.
Ann. Math. Artif. Intell., 1993

1989
A Formal Model for Context-Free Languages Augmented with Reduplication.
Computational Linguistics, 1989

1984
Consistency in Nondeterministic Storage.
J. Comput. Syst. Sci., 1984

On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps.
Inf. Process. Lett., 1984

1983
A Note on Relativized Log Space.
Mathematical Systems Theory, 1983

1982
Parallel Random Access Machines with Powerful Instruction Sets.
Mathematical Systems Theory, 1982

1981
On the amount of non-determinism in pushdown in pushdown automata.
Fundam. Inform., 1981

1980
Growth Functions of Stochastic Lindenmayer Systems
Information and Control, June, 1980

1979
Programs for Instruction Machines
Information and Control, April, 1979

Time Bounded Random Access Machines with Parallel Processing.
J. ACM, 1979

1978
On Inverse Deterministic Pushdown Transductions.
J. Comput. Syst. Sci., 1978

Parallel and Nondeterministic Time Complexity Classes (Preliminary Report).
Proceedings of the Automata, 1978

Graphs of Processors.
Proceedings of the Graph-Grammars and Their Application to Computer Science and Biology, International Workshop, Bad Honnef, October 30, 1978

1977
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps.
Proceedings of the Automata, 1977

1975
Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines
Information and Control, January, 1975

The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages.
Theor. Comput. Sci., 1975

Ambiguity in the Developmental Systems of Lindenmayer.
J. Comput. Syst. Sci., 1975

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

Maze Recognizing Automata and Nondeterministic Tape Complexity.
J. Comput. Syst. Sci., 1973

A Note on Multihead Automata and Context-Sensitive Languages
Acta Inf., 1973

1972
Maze Recognizing Automata (Extended Abstract)
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1970
Relationships Between Nondeterministic and Deterministic Tape Complexities.
J. Comput. Syst. Sci., 1970

1969
Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract)
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969


  Loading...