| The 1982 ACM Turing Award Lecture: An Overview of Computational Complexity SA Cook Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023 | | 2023 |
| A survey of classes of primitive recursive functions SA Cook Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023 | 4 | 2023 |
| A time-space tradeoff for sorting on a general sequential model of computation A Borodin, S Cook Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023 | 211 | 2023 |
| Towards a complexity theory of synchronous parallel computation SA Cook Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023 | 204 | 2023 |
| Feasibly constructive proofs and the propositional calculus (preliminary version) SA Cook Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023 | 322 | 2023 |
| Characterizations of Pushdown Machines in Terms of Time-Bounded Computers SA Cook Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023 | | 2023 |
| The relative efficiency of propositional proof systems SA Cook, RA Reckhow Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023 | 2 | 2023 |
| The complexity of theorem-proving procedures SA Cook Logic, automata, and computational complexity: The works of Stephen A. Cook …, 2023 | 11006 | 2023 |
| CS 4995 Notes Fall, 2022 S Cook, T Pitassi Notes, 2022 | | 2022 |
| The complexity of theorem-proving procedures (1971) SA Cook | 9 | 2021 |
| Uniform, integral, and feasible proofs for the determinant identities I Tzameret, SA Cook Journal of the ACM (JACM) 68 (2), 1-80, 2021 | 6 | 2021 |
| CSC 438F/2404F Notes Fall, 2019 S Cook, T Pitassi Notes, 2019 | | 2019 |
| Uniform, integral and efficient proofs for the determinant identities I Tzameret, SA Cook 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 8 | 2017 |
| Strongly exponential lower bounds for monotone computation T Pitassi, R Robere Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 52 | 2017 |
| Exponential lower bounds for monotone span programs R Robere, T Pitassi, B Rossman, SA Cook 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 72 | 2016 |
| Relativizing small complexity classes and their theories K Aehlig, S Cook, P Nguyen computational complexity 25, 177-215, 2016 | 2 | 2016 |
| Exponential lower bounds for monotone span programs SA Cook, T Pitassi, R Robere, B Rossman Electronic Colloquium on Computational Complexity, Report, 2016 | 8 | 2016 |
| Lower bounds for nondeterministic semantic read-once branching programs S Cook, J Edmonds, V Medabalimi, T Pitassi 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 7 | 2016 |
| A complexity primer for systems engineers J McEver, SA Sheard, S Cook, E Honour, D Hybertson, J Krupa, ... International Council on Systems Engineering, 2015 | 7 | 2015 |
| A complexity primer for systems engineers S Sheard, S Cook, E Honour, D Hybertson, J Krupa, J McEver, ... INCOSE Complex Systems Working Group White Paper 1 (1), 1-10, 2015 | 64 | 2015 |
