| 2017 | LICS | Uniform, integral and efficient proofs for the determinant identities. | Iddo Tzameret, Stephen A. Cook |
| 2016 | FOCS | Exponential Lower Bounds for Monotone Span Programs. | Robert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook |
| 2016 | ICALP | Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. | Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi |
| 2013 | CSL | Theories for Subexponential-size Bounded-depth Frege Proofs. | Kaveh Ghasemloo, Stephen A. Cook |
| 2013 | FOCS | Average Case Lower Bounds for Monotone Switching Networks. | Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook |
| 2012 | CSL | Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk). | Stephen A. Cook |
| 2011 | CSL | A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem. | Dai Tri Man Le, Stephen A. Cook, Yuli Ye |
| 2011 | LICS | Formalizing Randomized Matching Algorithms. | Dai Tri Man Le, Stephen A. Cook |
| 2010 | CSL | Formal Theories for Linear Algebra. | Stephen A. Cook, Lila Fontes |
| 2010 | STOC | Complexity theory for operators in analysis. | Akitoshi Kawamura, Stephen A. Cook |
| 2009 | MFCS | Branching Programs for Tree Evaluation. | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
| 2007 | CSL | Relativizing Small Complexity Classes and Their Theories. | Klaus Aehlig, Stephen A. Cook, Phuong Nguyen |
| 2007 | LICS | The Complexity of Proving the Discrete Jordan Curve Theorem. | Phuong Nguyen, Stephen A. Cook |
| 2004 | LICS | A Second-Order Theory for NL. | Stephen A. Cook, Antonina Kolokolova |
| 2004 | LICS | The Strength of Replacement in Weak Arithmetic. | Stephen A. Cook, Neil Thapen |
| 2004 | LICS | VTC | Phuong Nguyen, Stephen A. Cook |
| 2002 | ISAIM | A Complete Axiomatization for Blocks World. | Stephen A. Cook, Yongmei Liu |
| 2002 | LICS | Complexity Classes, Propositional Proof Systems, and Formal Theories. | Stephen A. Cook |
| 2002 | LICS | The Proof Complexity of Linear Algebra. | Michael Soltys, Stephen A. Cook |
| 2001 | LICS | A Second-Order System for Polytime Reasoning Using Graedel's Theorem. | Stephen A. Cook, Antonina Kolokolova |
| 1995 | STOC | The relative complexity of NP search problems. | Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi |
| 1992 | STOC | A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract) | Stephen J. Bellantoni, Stephen A. Cook |
| 1991 | FOCS | A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) | Bruce M. Kapron, Stephen A. Cook |
| 1989 | FOCS | Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) | Stephen A. Cook, Bruce M. Kapron |
| 1989 | STOC | Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) | Stephen A. Cook, Alasdair Urquhart |
| 1984 | FOCS | Log Depth Circuits for Division and Related Problems | Paul Beame, Stephen A. Cook, H. James Hoover |
| 1983 | FCT | The Classifikation of Problems which have Fast Parallel Algorithms. | Stephen A. Cook |
| 1983 | FOCS | The Parallel Complexity of the Abelian Permutation Group Membership Problem | Pierre McKenzie, Stephen A. Cook |
| 1982 | STOC | Bounds on the Time for Parallel RAM's to Compute Simple Functions | Stephen A. Cook, Cynthia Dwork |
| 1980 | FOCS | Hardware Complexity and Parallel Computation (Preliminary Version) | Patrick W. Dymond, Stephen A. Cook |
| 1980 | STOC | A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation | Allan Borodin, Stephen A. Cook |
| 1979 | STOC | Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log Squared Space | Stephen A. Cook |
| 1975 | POPL | An Assertion Language for Data Structures. | Stephen A. Cook, Derek C. Oppen |
| 1975 | STOC | Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version) | Stephen A. Cook |
| 1975 | STOC | Proving Assertions about Programs that Manipulate Data Structures | Derek C. Oppen, Stephen A. Cook |
| 1974 | STOC | On the Number of Additions to Compute Specific Polynomials (Preliminary Version) | Allan Borodin, Stephen A. Cook |
| 1974 | STOC | On the Lengths of Proofs in the Propositional Calculus (Preliminary Version) | Stephen A. Cook, Robert A. Reckhow |
| 1974 | STOC | Storage Requirements for Deterministic Polynomial Time Recognizable Languages | Stephen A. Cook, Ravi Sethi |
| 1973 | STOC | An Observation on Time-Storage Trade Off | Stephen A. Cook |
| 1972 | STOC | A Hierarchy for Nondeterministic Time Complexity | Stephen A. Cook |
| 1972 | STOC | Time-Bounded Random Access Machines | Stephen A. Cook, Robert A. Reckhow |
| 1971 | STOC | The Complexity of Theorem-Proving Procedures | Stephen A. Cook |
| 1970 | STOC | Path Systems and Language Recognition | Stephen A. Cook |
| 1969 | STOC | Variations on Pushdown Machines (Detailed Abstract) | Stephen A. Cook |