Vardi 1982. Vardi, Moshe Y. (1982). "The Complexity of Relational Query Languages". STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing. pp. 137–146. doi:10.1145/800070.802186.
Immerman 1982. Immerman, Neil (1982). "Relational Queries Computable in Polynomial Time". Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC '82). pp. 147–152. doi:10.1145/800070.802187. Revised version in Information and Control, 68 (1986), 86–104
Rabin 1967. Rabin, Michael O. (1967). "Mathematical theory of automata". Mathematical Aspects of Computer Science. Proceedings of Symposia in Applied Mathematics. Vol. 19. American Mathematical Society. pp. 153–175. doi:10.1090/psapm/019.
Cobham (1965) was mentioned in Cook (1971)Cobham, Alan (1965). "The Intrinsic Computational Difficulty of Functions". In Bar-Hillel, Yehoshua (ed.). Logic, Methodology and Philosophy of Science: Proceedings of the 1964 International Congress. Amsterdam: North-Holland. pp. 24–30. Cook, Stephen A. (1971). "The Complexity of Theorem-Proving Procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. ACM. pp. 151–158. doi:10.1145/800157.805047.