Selected papers that cite this one
- J. Hartmanis and J. E. Hopcroft. An overview of the theory of computational complexity. Journal of the ACM, 18(3):444-475, July 1971.
- F. C. Hennie. One-tape, off-line Turing machine computations. Information and Control, 8(6):553-578, December 1965.
- S.-Y. Kuroda. Classes of languages and linear-bounded automata. Information and Control, 7(2):207-223, June 1964.
- R. E. Stearns, J. Hartmanis, and P. M. Lewis II. Hierarchies of memory limited computations. In Proceedings of the Sixth Annual Symposium on Switching Circuit Theory and Logical Design, pages 179-190. IEEE, 1965.