Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata

Relationships between nondeterministic and deterministic tape complexities

Walter J. Savitch · Journal of Computer and System Sciences · 1970 · 1.4K citations

Computing, Computer Science, Algorithms +5

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Stephen Cook · Journal of the ACM · 1971 · 362 citations · Full text

Computing, Computer Science, Computer Architecture +6

Hierarchies of memory limited computations

Richard E. Stearns, Juris Hartmanis, Philip Lewis · 1965 · 357 citations

Computing, Computer Science, Algorithms +11

Two-Tape Simulation of Multitape Turing Machines

F. C. Hennie, Richard E. Stearns · Journal of the ACM · 1966 · 287 citations · Full text

Computing, Computer Science, Algorithms +8

Stack automata and compiling

Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison · Journal of the ACM · 1967 · 141 citations · Full text

Computing, Computer Engineering, Computer Science +12