Walter J. Savitch - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2011

The Software Side of Computer Science - Computer ProgrammingEdward K. Blum, Walter J. Savitch. In Edward K. Blum, Alfred V. Aho, editors, Computer Science, The Hardware, Software and Heart of It. pages 53-68, Springer, 2011. [doi]

2001

Writing a textbook: walking the gauntletNell B. Dale, Rick Mercer, Elliot B. Koffman, Walter J. Savitch. sigcse 2001: 408-409 [doi]

1995

An occurrence-based model of word categorizationP. A. Bensch, Walter J. Savitch. AMAI, 14(1):1-16, 1995.

Data structures and other objects - Turbo Pascal editionMichael Main, Walter J. Savitch. Benjamin/Cummings, 1995.

Problem solving with C++ - the object of programmingWalter J. Savitch. Addison-Wesley, 1995.

1994

Teaching Ada by the book: the pedagogy of Ada in CS1John W. McCormick, Fintan Culwin, Nicholas J. DeLillo, Michael B. Feldman, Richard E. Pattis, Walter J. Savitch. sigcse 1994: 385-386 [doi]

1993

Why it Might Pay to Assume That Languages are infiniteWalter J. Savitch. AMAI, 8(1-2):17-25, 1993.

1989

A Formal Model for Context-Free Languages Augmented with ReduplicationWalter J. Savitch. coling, 15(4):250-261, 1989.

1984

On the Power of Real-Time Two-Way Multihead Finite Automata With JumpsWalter J. Savitch, Paul M. B. Vitányi. ipl, 19(1):31-35, 1984.

Consistency in Nondeterministic StorageWalter J. Savitch, Patrick W. Dymond. jcss, 29(1):118-132, 1984.

1983

A Note on Relativized Log SpaceWalter J. Savitch. mst, 16(4):229-235, 1983.

1982

Parallel Random Access Machines with Powerful Instruction SetsWalter J. Savitch. mst, 15(3):191-210, 1982.

1981

On the amount of non-determinism in pushdown in pushdown automataDirk Vermeir, Walter J. Savitch. FUIN, 4(2):401-418, 1981.

1980

Growth Functions of Stochastic Lindenmayer SystemsPeter Eichhorst, Walter J. Savitch. iandc, 45(3):217-228, June 1980.

1979

Programs for Instruction MachinesZdzislaw Pawlak, Grzegorz Rozenberg, Walter J. Savitch. iandc, 41(1):9-28, April 1979.

Time Bounded Random Access Machines with Parallel ProcessingWalter J. Savitch, Michael J. Stimson. JACM, 26(1):103-118, 1979. [doi]

1978

Parallel and Nondeterministic Time Complexity Classes (Preliminary Report)Walter J. Savitch. icalp 1978: 411-424

Graphs of ProcessorsWalter J. Savitch. gg 1979: 418-425

On Inverse Deterministic Pushdown TransductionsPaul M. B. Vitányi, Walter J. Savitch. jcss, 16(3):423-444, 1978.

1977

Linear Time Simulation of Multihead Turing Machines with Head-to-Head JumpsWalter J. Savitch, Paul M. B. Vitányi. icalp 1977: 453-464

1975

The Turing Degree of the Inherent Ambiguity Problem for Context-Free LanguagesAnn Reedy, Walter J. Savitch. TCS, 1(1):77-91, 1975.

Ambiguity in the Developmental Systems of LindenmayerAnn Reedy, Walter J. Savitch. jcss, 11(2):262-283, 1975.

Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack MachinesWalter J. Savitch. iandc, 27(1):37-60, January 1975.

Ambiguous Developmental PlansWalter J. Savitch. Lsystems 1976: 293-300

Computational Complexity of Developmental ProgramsWalter J. Savitch. Lsystems 1976: 283-291

1973

A Note on Multihead Automata and Context-Sensitive LanguagesWalter J. Savitch. ACTA, 2:249-252, 1973.

Maze Recognizing Automata and Nondeterministic Tape ComplexityWalter J. Savitch. jcss, 7(4):389-403, 1973.

How to Make Arbitrary Grammars Look Like Context-Free GrammarsWalter J. Savitch. SICOMP, 2(3):174-182, 1973.

1972

Maze Recognizing Automata (Extended Abstract)Walter J. Savitch. stoc 1972: 151-156

1970

Relationships Between Nondeterministic and Deterministic Tape ComplexitiesWalter J. Savitch. jcss, 4(2):177-192, 1970.

1969

Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract)Walter J. Savitch. stoc 1969: 247-248

Sign in or sign up to see more results.

runs on WebDSL