1. M. Blum, A Machine-Independent Theory of the Complexity of Recursive Functions, J. ACM 14, 1967, 322–336.
2. M. Blum, On Effective Procedures for Speeding up Algorithms, J. ACM 18, 1971, 290–305.
3. A. Borodin, Computational Complexity and the Existence of Complexity Gaps, J. ACM 19, 1972, 158–174.
4. B. Baker, R. Book, Reversal-Bounded Multipushdown Machines, J. CSS 8, 1974, 315–322.
5. S. Cook, A Hierarchy for Nondeterministic Time Complexity, J. CSS 7, 1973, 343–353.