| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam |
Pebbles and Branching Programs for Tree Evaluation.  |
TOCT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Lila Fontes |
Formal Theories for Linear Algebra |
Logical Methods in Computer Science |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Stephen A. Cook, Phuong Nguyen |
Relativizing Small Complexity Classes and their Theories |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Phuong Nguyen, Stephen A. Cook |
The Complexity of Proving the Discrete Jordan Curve Theorem. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dai Tri Man Le, Stephen A. Cook |
Formalizing Randomized Matching Algorithms |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dai Tri Man Le, Stephen A. Cook, Yuli Ye |
Complexity Classes and Theories for the Comparator Circuit Value Problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dai Tri Man Le, Stephen A. Cook |
Formalizing Randomized Matching Algorithms. |
LICS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dai Tri Man Le, Stephen A. Cook, Yuli Ye |
A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem. |
CSL |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Phuong Nguyen, Stephen A. Cook |
The Complexity of Proving the Discrete Jordan Curve Theorem |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam |
Pebbles and Branching Programs for Tree Evaluation |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Lila Fontes |
Formal Theories for Linear Algebra. |
CSL |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Akitoshi Kawamura, Stephen A. Cook |
Complexity theory for operators in analysis. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
higher-type complexity, second-order polynomials, computational complexity, computable analysis |
| 1 | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
Branching Programs for Tree Evaluation. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
Fractional Pebbling and Thrifty Branching Programs. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Jan Krajícek |
Consequences of the provability of NP SUBSET OF OR EQUAL TO P/poly. |
J. Symb. Log. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Phuong Nguyen, Stephen A. Cook |
The Complexity of Proving the Discrete Jordan Curve Theorem. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Stephen A. Cook, Phuong Nguyen |
Relativizing Small Complexity Classes and Their Theories. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Phuong Nguyen, Stephen A. Cook |
Theories for TC0 and Other Small Complexity Classes. |
Logical Methods in Computer Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Comments on Beckmann's Uniform Reducts |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Neil Thapen |
The strength of replacement in weak arithmetic. |
ACM Trans. Comput. Log. |
2006 |
DBLP DOI BibTeX RDF |
cryptography, PV, Bounded arithmetic |
| 1 | Mark Braverman, Stephen A. Cook |
Computing over the Reals: Foundations for Scientific Computing |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Phuong Nguyen, Stephen A. Cook |
Theories for TC0 and Other Small Complexity Classes |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Tsuyoshi Morioka |
Quantified propositional calculus and a second-order theory for NC1. |
Arch. Math. Log. |
2005 |
DBLP DOI BibTeX RDF |
Computational Complexity, Proof Complexity, Bounded Arithmetic |
| 1 | Michael Soltys, Stephen A. Cook |
The proof complexity of linear algebra. |
Ann. Pure Appl. Logic |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Neil Thapen |
The strength of replacement in weak arithmetic |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Antonina Kolokolova |
A Second-Order Theory for NL. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Neil Thapen |
The Strength of Replacement in Weak Arithmetic. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Phuong Nguyen, Stephen A. Cook |
VTC circ: A Second-Order Theory for TCcirc. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Yongmei Liu |
A Complete Axiomatization for Blocks World. |
J. Log. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Antonina Kolokolova |
A second-order system for polytime reasoning based on Grädel's theorem. |
Ann. Pure Appl. Logic |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
The importance of the P versus NP question. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Jan K. Pachl, Irwin S. Pressman |
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy. |
Distributed Computing |
2002 |
DBLP DOI BibTeX RDF |
Optimization, Dynamic programming, NP-completeness, Data replication |
| 1 | Stephen A. Cook, Yongmei Liu |
A Complete Axiomatization for Blocks World. |
ISAIM |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael Soltys, Stephen A. Cook |
The Proof Complexity of Linear Algebra. |
LICS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Complexity Classes, Propositional Proof Systems, and Formal Theories. |
LICS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Yongmei Liu |
A Complete Axiomatization for Blocks World. |
AMAI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Antonina Kolokolova |
A second-order system for polynomial-time reasoning based on Graedel's theorem |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Antonina Kolokolova |
A Second-Order System for Polytime Reasoning Using Graedel's Theorem. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentine Kabanets, Charles Rackoff, Stephen A. Cook |
Efficiently Approximable Real-Valued Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Armin Haken, Stephen A. Cook |
An Exponential Lower Bound for the Size of Monotone Real Circuits. |
J. Comput. Syst. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi |
The Relative Complexity of NP Search Problems. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Russell Impagliazzo, Tomoyuki Yamakami |
A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory. |
Inf. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce M. Kapron, Stephen A. Cook |
A New Characterization of Type-2 Feasibility. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi |
The relative complexity of NP search problems. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Alasdair Urquhart |
Functional Interpretations of Feasibly Constructive Arithmetic. |
Ann. Pure Appl. Logic |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Patrick W. Dymond |
Parallel Pointer Machines. |
Computational Complexity |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Bellantoni, Stephen A. Cook |
A New Recursion-Theoretic Characterization of the Polytime Functions. |
Computational Complexity |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Irwin S. Pressman, Stephen A. Cook, Jan K. Pachl |
The optimal placement of replicas in a network using a read any - write all policy. |
CASCON |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Bellantoni, Stephen A. Cook |
A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract) |
STOC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce M. Kapron, Stephen A. Cook |
A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
polytime operators, Mehlhorn's polynomial time functionals, machine-independent characterization, computational feasibility, type 2 functionals, feasibility, inductive definition |
| 1 | Stephen A. Cook, Toniann Pitassi |
A Feasibly Constructive Lower Bound for Resolution Proofs. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick W. Dymond, Stephen A. Cook |
Complexity Theory of Parallel Time and Hardware |
Inf. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa |
Erratum: Two Applications of Inductive Counting for Complementation Problems. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa |
Two Applications of Inductive Counting for Complementation Problems. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Bruce M. Kapron |
Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
finite type functional, simple typed while-programming language, mu -recursion, feasible functionals, length-bounded, bounded typed loop program, run times |
| 1 | Stephen A. Cook, Alasdair Urquhart |
Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Michael Luby |
A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. |
Inf. Process. Lett. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Short Propositional Formulas Represent Nondeterministic Computations. |
Inf. Process. Lett. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Pierre McKenzie |
Problems Complete for Deterministic Logarithmic Space. |
J. Algorithms |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Stephen A. Cook |
The Parallel Complexity of Abelian Permutation Group Problems. |
SIAM J. Comput. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Cynthia Dwork, Rüdiger Reischuk |
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Stephen A. Cook, H. James Hoover |
Log Depth Circuits for Division and Related Problems. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
A Taxonomy of Problems with Fast Parallel Algorithms |
Information and Control |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, H. James Hoover |
A Depth-Universal Circuit. |
SIAM J. Comput. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Stephen A. Cook, H. James Hoover |
Log Depth Circuits for Division and Related Problems |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Burchard von Braunmühl, Stephen A. Cook, Kurt Mehlhorn, Rutger Verbeek |
The Recognition of Deterministic CFL's in Small Time and Space |
Information and Control |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Stephen A. Cook, Nicholas Pippenger |
Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines |
Information and Control |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
An Overview of Computational Complexity. |
Commun. ACM |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
The Classifikation of Problems which have Fast Parallel Algorithms. |
FCT |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Stephen A. Cook |
The Parallel Complexity of the Abelian Permutation Group Membership Problem |
FOCS |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Stephen A. Cook |
A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation. |
SIAM J. Comput. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Cynthia Dwork |
Bounds on the Time for Parallel RAM's to Compute Simple Functions |
STOC |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Corrigendum: Soundness and Completeness of an Axiom System for Program Verification. |
SIAM J. Comput. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Charles Rackoff |
Space Lower Bounds for Maze Threadability on Restricted Machines. |
SIAM J. Comput. |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick W. Dymond, Stephen A. Cook |
Hardware Complexity and Parallel Computation (Preliminary Version) |
FOCS |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Stephen A. Cook |
A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation |
STOC |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Robert A. Reckhow |
The Relative Efficiency of Propositional Proof Systems. |
J. Symb. Log. |
1979 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook |
Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log Squared Space |
STOC |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Soundness and Completeness of an Axiom System for Program Verification. |
SIAM J. Comput. |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Ravi Sethi |
Storage Requirements for Deterministic Polynomial Time Recognizable Languages. |
J. Comput. Syst. Sci. |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Stephen A. Cook |
On the Number of Additions to Compute Specific Polynomials. |
SIAM J. Comput. |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Derek C. Oppen |
An Assertion Language for Data Structures. |
POPL |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version) |
STOC |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek C. Oppen, Stephen A. Cook |
Proving Assertions about Programs that Manipulate Data Structures |
STOC |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
An Observation on Time-Storage Trade Off. |
J. Comput. Syst. Sci. |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Ravi Sethi |
Storage Requirements for Deterministic Polynomial Time Recognizable Languages |
STOC |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Stephen A. Cook |
On the Number of Additions to Compute Specific Polynomials (Preliminary Version) |
STOC |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Robert A. Reckhow |
On the Lengths of Proofs in the Propositional Calculus (Preliminary Version) |
STOC |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
A Hierarchy for Nondeterministic Time Complexity. |
J. Comput. Syst. Sci. |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Robert A. Reckhow |
Time Bounded Random Access Machines. |
J. Comput. Syst. Sci. |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
An Observation on Time-Storage Trade Off |
STOC |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
A Hierarchy for Nondeterministic Time Complexity |
STOC |
1972 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Robert A. Reckhow |
Time-Bounded Random Access Machines |
STOC |
1972 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers. |
J. ACM |
1971 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Linear Time Simulation of Deterministic Two-Way Pushdown Automata. |
IFIP Congress |
1971 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook |
The Complexity of Theorem-Proving Procedures |
STOC |
1971 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Path Systems and Language Recognition |
STOC |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
Variations on Pushdown Machines (Detailed Abstract) |
STOC |
1969 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook |
The Solvability of the Derivability Problem for One-Normal Systems. |
J. ACM |
1966 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")