1. Andersen, N. and Jones, N. D., Generalizing Cook’s construction to imperative stack programs, Lecture Notes in Computer Science 812, pp. 1–18, Springer-Verlag, 1994.
2. Cook, S. A., Linear-time simulation of deterministic two-way pushdown automata, Information Processing (IFIP) 71, C.V. Freiman, (ed.), North-Holland, pp. 75–80, 1971.
3. Cook, S. A., Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM 18 (1971), 4–18.
4. Cook, S. A., The complexity of theorem-proving procedures, Proceedings Third Symposium on the Theory of Computing, pp. 151–158, ACM Press, 1971
5. Ben-Amram, A. and Jones, N. D. A precise version of a time hierarchy theorem. Fundamenta Informaticae, vol. 38, pp. 1–15. 1999.