Walter J. Savitch

According to our database, Walter J. Savitch authored at least 31 papers between 1969 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

The Software Side of Computer Science - Computer Programming.

Edward K. Blum, Walter J. Savitch

Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2001

Writing a textbook: walking the gauntlet.

Nell B. Dale, Rick Mercer, Elliot B. Koffman, Walter J. Savitch

Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

1995

An occurrence-based model of word categorization.

P. A. Bensch, Walter J. Savitch

Ann. Math. Artif. Intell., 1995

Problem solving with C++ - the object of programming.

Walter J. Savitch

Addison-Wesley, ISBN: 978-0-8053-7440-7, 1995

Data structures and other objects - Turbo Pascal edition.

Michael Main, Walter J. Savitch

Benjamin/Cummings, ISBN: 978-0-8053-7086-7, 1995

1994

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

Proceedings of the 25th SIGCSE Technical Symposium on Computer Science Education, 1994

1993

Why it Might Pay to Assume That Languages are infinite.

Walter J. Savitch

Ann. Math. Artif. Intell., 1993

1989

A Formal Model for Context-Free Languages Augmented with Reduplication.

Walter J. Savitch

Comput. Linguistics, 1989

1984

Consistency in Nondeterministic Storage.

Walter J. Savitch, Patrick W. Dymond

J. Comput. Syst. Sci., 1984

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

1983

A Note on Relativized Log Space.

Walter J. Savitch

Math. Syst. Theory, 1983

1982

Parallel Random Access Machines with Powerful Instruction Sets.

Walter J. Savitch

Math. Syst. Theory, 1982

1981

On the amount of non-determinism in pushdown in pushdown automata.

Dirk Vermeir, Walter J. Savitch

Fundam. Informaticae, 1981

1980

Growth Functions of Stochastic Lindenmayer Systems

Peter Eichhorst, Walter J. Savitch

Inf. Control., June, 1980

1979

Programs for Instruction Machines

Zdzislaw Pawlak, Grzegorz Rozenberg, Walter J. Savitch

Inf. Control., April, 1979

Time Bounded Random Access Machines with Parallel Processing.

Walter J. Savitch, Michael J. Stimson

J. ACM, 1979

1978

On Inverse Deterministic Pushdown Transductions.

Paul M. B. Vitányi, Walter J. Savitch

J. Comput. Syst. Sci., 1978

Parallel and Nondeterministic Time Complexity Classes (Preliminary Report).

Walter J. Savitch

Proceedings of the Automata, 1978

Graphs of Processors.

Walter J. Savitch

Proceedings of the Graph-Grammars and Their Application to Computer Science and Biology, 1978

1977

Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps.

Walter J. Savitch, Paul M. B. Vitányi

Proceedings of the Automata, 1977

1975

Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines

Walter J. Savitch

Inf. Control., January, 1975

The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages.

Ann Reedy, Walter J. Savitch

Theor. Comput. Sci., 1975

Ambiguity in the Developmental Systems of Lindenmayer.

Ann Reedy, Walter J. Savitch

J. Comput. Syst. Sci., 1975

Ambiguous Developmental Plans.

Walter J. Savitch

Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

Computational Complexity of Developmental Programs.

Walter J. Savitch

Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1973

How to Make Arbitrary Grammars Look Like Context-Free Grammars.

Walter J. Savitch

SIAM J. Comput., 1973

Maze Recognizing Automata and Nondeterministic Tape Complexity.

Walter J. Savitch

J. Comput. Syst. Sci., 1973

A Note on Multihead Automata and Context-Sensitive Languages

Walter J. Savitch

Acta Informatica, 1973

1972

Maze Recognizing Automata (Extended Abstract)

Walter J. Savitch

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1970

Relationships Between Nondeterministic and Deterministic Tape Complexities.

Walter J. Savitch

J. Comput. Syst. Sci., 1970

1969

Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract)

Walter J. Savitch

Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969