default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalter J. Savitch
Person information
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[p1]Edward K. Blum, Walter J. Savitch:
The Software Side of Computer Science - Computer Programming. Computer Science, The Hardware, Software and Heart of It 2011: 53-68
2000 – 2009
- 2001
- [c9]Nell B. Dale, Rick Mercer, Elliot B. Koffman, Walter J. Savitch:
Writing a textbook: walking the gauntlet. SIGCSE 2001: 408-409
1990 – 1999
- 1995
- [b2]Michael Main, Walter J. Savitch:
Data structures and other objects - Turbo Pascal edition. Benjamin/Cummings 1995, ISBN 978-0-8053-7086-7, pp. I-XXVI, 1-813 - [b1]Walter J. Savitch:
Problem solving with C++ - the object of programming. Addison-Wesley 1995, ISBN 978-0-8053-7440-7, pp. I-XXXI, 1-805 - [j19]P. A. Bensch, Walter J. Savitch:
An occurrence-based model of word categorization. Ann. Math. Artif. Intell. 14(1): 1-16 (1995) - 1994
- [c8]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
- [j18]Walter J. Savitch:
Why it Might Pay to Assume That Languages are infinite. Ann. Math. Artif. Intell. 8(1-2): 17-25 (1993)
1980 – 1989
- 1989
- [j17]Walter J. Savitch:
A Formal Model for Context-Free Languages Augmented with Reduplication. Comput. Linguistics 15(4): 250-261 (1989) - 1984
- [j16]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) - [j15]Walter J. Savitch, Patrick W. Dymond:
Consistency in Nondeterministic Storage. J. Comput. Syst. Sci. 29(1): 118-132 (1984) - 1983
- [j14]Walter J. Savitch:
A Note on Relativized Log Space. Math. Syst. Theory 16(4): 229-235 (1983) - 1982
- [j13]Walter J. Savitch:
Parallel Random Access Machines with Powerful Instruction Sets. Math. Syst. Theory 15(3): 191-210 (1982) - 1981
- [j12]Dirk Vermeir, Walter J. Savitch:
On the amount of non-determinism in pushdown in pushdown automata. Fundam. Informaticae 4(2): 401-418 (1981) - 1980
- [j11]Peter Eichhorst, Walter J. Savitch:
Growth Functions of Stochastic Lindenmayer Systems. Inf. Control. 45(3): 217-228 (1980)
1970 – 1979
- 1979
- [j10]Zdzislaw Pawlak, Grzegorz Rozenberg, Walter J. Savitch:
Programs for Instruction Machines. Inf. Control. 41(1): 9-28 (1979) - [j9]Walter J. Savitch, Michael J. Stimson:
Time Bounded Random Access Machines with Parallel Processing. J. ACM 26(1): 103-118 (1979) - 1978
- [j8]Paul M. B. Vitányi, Walter J. Savitch:
On Inverse Deterministic Pushdown Transductions. J. Comput. Syst. Sci. 16(3): 423-444 (1978) - [c7]Walter J. Savitch:
Graphs of Processors. Graph-Grammars and Their Application to Computer Science and Biology 1978: 418-425 - [c6]Walter J. Savitch:
Parallel and Nondeterministic Time Complexity Classes (Preliminary Report). ICALP 1978: 411-424 - [e1]Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho:
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA. ACM 1978 [contents] - 1977
- [c5]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
- [j7]Walter J. Savitch:
Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines. Inf. Control. 27(1): 37-60 (1975) - [j6]Ann Reedy, Walter J. Savitch:
Ambiguity in the Developmental Systems of Lindenmayer. J. Comput. Syst. Sci. 11(2): 262-283 (1975) - [j5]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) - [c4]Walter J. Savitch:
Computational Complexity of Developmental Programs. Automata, Languages, Development 1975: 283-291 - [c3]Walter J. Savitch:
Ambiguous Developmental Plans. Automata, Languages, Development 1975: 293-300 - 1973
- [j4]Walter J. Savitch:
A Note on Multihead Automata and Context-Sensitive Languages. Acta Informatica 2: 249-252 (1973) - [j3]Walter J. Savitch:
Maze Recognizing Automata and Nondeterministic Tape Complexity. J. Comput. Syst. Sci. 7(4): 389-403 (1973) - [j2]Walter J. Savitch:
How to Make Arbitrary Grammars Look Like Context-Free Grammars. SIAM J. Comput. 2(3): 174-182 (1973) - 1972
- [c2]Walter J. Savitch:
Maze Recognizing Automata (Extended Abstract). STOC 1972: 151-156 - 1970
- [j1]Walter J. Savitch:
Relationships Between Nondeterministic and Deterministic Tape Complexities. J. Comput. Syst. Sci. 4(2): 177-192 (1970)
1960 – 1969
- 1969
- [c1]Walter J. Savitch:
Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract). STOC 1969: 247-248
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
