The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Walter J. Savitch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Walter J. Savitch
    Relationships Between Nondeterministic and Deterministic Tape Complexities. [Citation Graph (4, 0)][DBLP]
    J. Comput. Syst. Sci., 1970, v:4, n:2, pp:177-192 [Journal]
  2. Walter J. Savitch
    Graphs of Processors. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science and Biology, 1978, pp:418-425 [Conf]
  3. Walter J. Savitch
    Parallel and Nondeterministic Time Complexity Classes (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    ICALP, 1978, pp:411-424 [Conf]
  4. Walter J. Savitch, Paul M. B. Vitányi
    Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:453-464 [Conf]
  5. Nell B. Dale, Rick Mercer, Elliot B. Koffman, Walter J. Savitch
    Writing a textbook: walking the gauntlet. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2001, pp:408-409 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1994, pp:385-386 [Conf]
  7. Walter J. Savitch
    Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1969, pp:247-248 [Conf]
  8. Walter J. Savitch
    Maze Recognizing Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:151-156 [Conf]
  9. Walter J. Savitch
    A Note on Multihead Automata and Context-Sensitive Languages [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1973, v:2, n:, pp:249-252 [Journal]
  10. P. A. Bensch, Walter J. Savitch
    An occurrence-based model of word categorization. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:14, n:1, pp:- [Journal]
  11. Walter J. Savitch
    Why it Might Pay to Assume That Languages are infinite. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1993, v:8, n:1-2, pp:17-25 [Journal]
  12. Walter J. Savitch
    A Formal Model for Context-Free Languages Augmented with Reduplication. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 1989, v:15, n:4, pp:250-261 [Journal]
  13. Dirk Vermeir, Walter J. Savitch
    On the amount of non-determinism in pushdown in pushdown automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:2, pp:401-418 [Journal]
  14. Peter Eichhorst, Walter J. Savitch
    Growth Functions of Stochastic Lindenmayer Systems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:45, n:3, pp:217-228 [Journal]
  15. Zdzislaw Pawlak, Grzegorz Rozenberg, Walter J. Savitch
    Programs for Instruction Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:41, n:1, pp:9-28 [Journal]
  16. Walter J. Savitch
    Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:27, n:1, pp:37-60 [Journal]
  17. Walter J. Savitch, Paul M. B. Vitányi
    On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:31-35 [Journal]
  18. Walter J. Savitch, Michael J. Stimson
    Time Bounded Random Access Machines with Parallel Processing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:103-118 [Journal]
  19. Ann Reedy, Walter J. Savitch
    Ambiguity in the Developmental Systems of Lindenmayer. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1975, v:11, n:2, pp:262-283 [Journal]
  20. Walter J. Savitch
    Maze Recognizing Automata and Nondeterministic Tape Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1973, v:7, n:4, pp:389-403 [Journal]
  21. Walter J. Savitch, Patrick W. Dymond
    Consistency in Nondeterministic Storage. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:29, n:1, pp:118-132 [Journal]
  22. Paul M. B. Vitányi, Walter J. Savitch
    On Inverse Deterministic Pushdown Transductions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:3, pp:423-444 [Journal]
  23. Walter J. Savitch
    Parallel Random Access Machines with Powerful Instruction Sets. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1982, v:15, n:3, pp:191-210 [Journal]
  24. Walter J. Savitch
    A Note on Relativized Log Space. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1983, v:16, n:4, pp:229-235 [Journal]
  25. Walter J. Savitch
    How to Make Arbitrary Grammars Look Like Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:3, pp:174-182 [Journal]
  26. Ann Reedy, Walter J. Savitch
    The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1975, v:1, n:1, pp:77-91 [Journal]

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002