Walter Savitch's AcademicInfluence.com Rankings Why Is Walter Savitch Influential? (Suggest an Edit or Addition)
According to Wikipedia , Walter John Savitch was best known for defining the complexity class NL , and for Savitch's theorem, which defines a relationship between the NSPACE and DSPACE complexity classes. His work in establishing complexity classes has helped to create the background against which non-deterministic and probabilistic reasoning can be performed.
(See a Problem?) Walter Savitch's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
1900 1910 1920 1930 1940 1950 1960 1970 1980 1990 2000 2010 0 125 250 375 500 625 750 875 1000 1125 1250 1375 Published Works Relationships Between Nondeterministic and Deterministic Tape Complexities (1970) Time Bounded Random Access Machines with Parallel Processing (1979) The Formal Complexity of Natural Language (1987) Maze Recognizing Automata and Nondeterministic Tape Complexity (1973) Growth Functions of Stochastic Lindenmayer Systems (1980) How to Make Arbitrary Grammars Look Like Context-Free Grammars (1973) Problem solving with C++ - the object of programming (1995) (33)Java: An Introduction to Computer Science and Programming, Third Edition (1998) (27)Problem solving with C (2006) (23)Why it might pay to assume that languages are infinite (1993) Absolute Java (2003) (20)Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines (1975) Deterministic simulation of non-deterministic turing machines (Detailed Abstract) (1969) A Formal Model for Context-Free Languages Augmented with Reduplication (1989) (17)Pascal - an introduction to the art and science of programming. second edition (1984) (15)A note on multihead automata and context-sensitive languages (1973) Abstract machines and grammars (1982) (14)Data structures and abstractions with Java (2002) (14)On the amount of non-determinism in pushdown in pushdown automata (1981) (13)That Pack a Punch : Lexical Class Priming of Picture Naming (1997) (12)Pascal: an introduction to the art and science of programming (3rd ed.) (1991) (12)Absolute C (2002) (11)Parallel and Nondeterministic Time Complexity Classes (Preliminary Report) (1978) Implementing neural networks (1988) (9)Recursive turing machines (1977) Context-Sensitive Grammar and Natural Language Syntax (1987) Java: An Introduction to Problem Solving & Programming (2004) (8)Data structures & other objects using C++ (2001) (7)Java: An Introduction to Problem Solving and Programming (4th Edition) (2004) (7)Programs for Instruction Machines (1979) Ambiguity in the Developmental Systems of Lindenmayer (1975) The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages (1975) Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps (1977) Ada: An Introduction to the Art and Science of Programming (1992) (6)Turbo Pascal : instructor's guide for : an introduction to the art and science of programming (1987) (6)Data Structures and Other Objects Using C++ (3rd Edition) (Savitch Series) (2004) (4)Problem Solving with C++, 7th Edition (2006) (4)An occurrence-based model of word categorization (1995) Turbo Pascal 4.0/5.0: An Introduction to the Art and Science of Programming (1989) (4)On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps (1984) On Inverse Deterministic Pushdown Transductions (1978) Review: P. M. Lewis, R. E. Stearns, J. Hartmanis, Memory Bounds for Recognition of Context-free and Context-Sensitive Languages (1972) (3)Absolute Java (3rd Edition) (2007) (3)Writing a textbook: walking the gauntlet (2001) Parentheses grammars and Lindenmayer grammars (1986) Nondeterministic tape bounded turing machines (1969) (2)Maze recognizing automata (Extended Abstract) (1972) Data Structures and Abstractions with Java (2nd Edition) (2005) (2)MyProgrammingLab with Pearson eText -- Access Card -- for Problem Solving with C++ (2011) (2)Teaching Ada by the book: the pedagogy of Ada in CS1 (1994) Java: An Introduction to Problem Solving and Programming, Student Value Edition Plus MyProgrammingLab with Pearson eText - Access Card Package (8th Edition) (2017) (2)Consistency in Nondeterministic Storage (1984) Parallel random access machines with powerful instruction sets (1981) Infinity is in the Eye of the Beholder (1991) Problem Solving with C++ Value Pack (2008) (1)Review: R. E. Stearns, J. Hartmanis, P. M. Lewis, Hierarchies of Memory Limited Computations (1972) (1)Java: An Introduction to Problem Solving and Programming plus MyProgrammingLab with Pearson eText -- Access Card Package (2014) (1)Theories of Language Learnability (1987) MyProgrammingLab with Pearson eText -- Access Card -- for Java: Intro to Problem Solving and Programming (2011) (1)The Software Side of Computer Science - Computer Programming (2011) Review: Oscar H. Ibarra, Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata (1974) (1)Data structures and other objects (Turbo Pascal ed.): a second course in computer science (1995) (1)Turbo Pascal 7.0 (1993) (1)A note on relativized log space (1983) Computational complexity in language models (1999) Absolute Java plus MyProgrammingLab with Pearson eText -- Access Card (2012) (0)Automatic classification of words in plain text corpora (1993) (0)Computational Complexity of Developmental Programs (1975) (0)Java: Introduction to Programming Sampling Edition (2008) (0)Absolute C++ Value Package (2007) (0)Data Structures and Other Objects: A Second Course in Computer Science (1994) (0)Absolute C++ (3rd Edition) (2007) (0)Absolute C++ CodeMate Enhanced Edition (2003) (0)Pascal: Does Turbo Pascal 5.0 belong in your classroom? (1989) (0)Data structures and other objects - Turbo Pascal edition (1995) (0)Graphs of Processors (1978) Turbo Pascal 2001.5 (1990) (0)Java : an introduction to problem solving & programming / Walter Savitch ; contributor, Kenrick Mock. (2015) (0)Hierarchies of recursive computations (1979) The Mathematics of Open Text and Infinite Language (1987) Absolute Java Value Package (2007) (0)Ambiguous Developmental Plans (1975) (0)Problem Solving with C++, Student Value Edition Plus MyProgrammingLab with Pearson eText - Access Card Package (10th Edition) (2017) (0)Ibarra Oscar H.. Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. Journal of computer and system sciences, vol. 5 (1971), pp. 88-117. (1974) Computationally driven semantics (1993) (0)Student Value Edition for Problem Solving with C (2011) (0)A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Cognitive Science and Linguistics (1997) (0)Absolute Java: AND Practical Debugging in Java (2008) (0)Is there a doctor in your classroom (1990) (0)Semen, Demonic Possession, and the Common Cold (1988) HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, 6TH, PROCEEDINGS, 1973. (2017) (0)Pascal report (1988) (0)On inverse deterministic pushdown transductions : (prepublication) (1976) (0)More Papers This paper list is powered by the following services:
Other Resources About Walter Savitch What Schools Are Affiliated With Walter Savitch? Walter Savitch is affiliated with the following schools:
