| 10 Characterizations of Pushdown Machines in Terms of Time-Bounded SA Cook Logic, Automata, and Computational Complexity, 153, 0 | | |
| 14 A Time-Space Tradeoff for Sorting on A Borodin, S Cook Logic, Automata, and Computational Complexity, 245, 1982 | | 1982 |
| 2000] Primary: 03F20; Secondary: 68Q17 COMPLEXITY OF SEMI-ALGEBRAIC PROOFS YI Manin, SA Cook, ARR CR79 | | |
| 2002 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM’02 LD Beklemishev, S Cook, O Lessmann, S Thomas, J Avigad, A Beckmann, ... The Bulletin of Symbolic Logic 9 (1), 2003 | | 2003 |
| 2008 ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC S Buss, S Cook, J Ferreirós, D Marker, T Slaman, J Tappenden The Bulletin of Symbolic Logic 14 (3), 2008 | | 2008 |
| 2008 Annual Meeting of the Association for Symbolic Logic-University of California, Irvine-Irvine, California-March 27-30, 2008-Abstracts S Buss, S Cook, J Ferreirs, A Lewis, D Marker, T Slaman, J Tappenden | | 2008 |
| 2008 CRM-Fields-PIMS Prize: Allan Borodin S Cook | | |
| A complete axiomatization for blocks world SA Cook, Y Liu Journal of Logic and Computation 13 (4), 581-594, 2003 | 31 | 2003 |
| A Complexity Class Based on Comparator Circuits S Cook SAS Opening Workshop “The Mathematical Legacy of Alan Turing”(Spitalfields …, 0 | | |
| 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 |
| A depth-universal circuit SA Cook, HJ Hoover SIAM Journal on Computing 14 (4), 833-839, 1985 | 53 | 1985 |
| A feasibly constructive lower bound for resolution proofs S Cook, T Pitassi Information Processing Letters 34 (2), 81-85, 1990 | 15 | 1990 |
| A formal theory for the complexity class associated with the stable marriage problem DTM Lê, SA Cook, Y Ye Computer Science Logic (CSL'11)-25th International Workshop/20th Annual …, 2011 | 9 | 2011 |
| A hierarchy for nondeterministic time complexity SA Cook Proceedings of the fourth annual ACM symposium on Theory of computing, 187-192, 1972 | 282 | 1972 |
| A new characterization of Mehlhorn's polynomial time functionals SA Cook, BM Kapron FOCS, 1991 | 6 | 1991 |
| A new characterization of Mehlhorn's polynomial time functionals BM Kapron, SA Cook FOCS, 342-347, 1991 | 34 | 1991 |
| A new characterization of type-2 feasibility BM Kapron, SA Cook SIAM Journal on Computing 25 (1), 117-132, 1996 | 121 | 1996 |
| A new recursion-theoretic characterization of the polytime functions S Bellantoni, S Cook Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992 | 668 | 1992 |
| A new recursion-theoretic characterization of the polytime functions(extended abstract) S Bellantoni, S Cook Annual ACM Symposium on Theory of Computing: Proceedings of the twenty …, 1992 | 10 | 1992 |
