Selected papers that cite this one
- A. Borodin. Computational complexity and the existence of complexity gaps. Journal of the ACM, 19(1):158-174, January 1972.
- Stephen A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM, 18(1):4-18, January 1971.
- Stephen A. Cook. Variations on pushdown machines (detailed abstract). In Conference Record of ACM Symposium on Theory of Computing, pages 229-231, Marina del Rey, California, 5-7 May 1969.
- Bin Fu, Hong-zhou Li, and Yong Zhong. An application of the translational method. Mathematical Systems Theory, 27(2):183-186, March/April 1994.
- J. Hartmanis. Computational complexity of one-tape Turing machine computations. Journal of the ACM, 15(2):325-339, April 1968.
- Juris Hartmanis. Relations between diagonalization, proof systems, and complexity gaps. Theoretical Computer Science, 8(2):239-253, April 1979.
- J. Hartmanis and J. E. Hopcroft. An overview of the theory of computational complexity. Journal of the ACM, 18(3):444-475, July 1971.
- Jack H. Lutz. Weakly hard problems. SIAM Journal on Computing, 24(6):1170-1189, December 1995.
- W. Paul. On-line simulation of k+1 tapes by k tapes requires nonlinear time. Information and Control, 53(1/2):1-8, April/May 1982.
- Kenneth W. Regan. Linear time and memory-efficient computation. SIAM Journal on Computing, 25(1):133-168, February 1996.
- F. C. Hennie. One-tape, off-line Turing machine computations. Information and Control, 8(6):553-578, December 1965.