The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephen A. Cook: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephen A. Cook
    The Complexity of Theorem-Proving Procedures [Citation Graph (19, 0)][DBLP]
    STOC, 1971, pp:151-158 [Conf]
  2. Stephen A. Cook
    An Observation on Time-Storage Trade Off. [Citation Graph (6, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:3, pp:308-316 [Journal]
  3. Stephen Bellantoni, Stephen A. Cook
    A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract) [Citation Graph (5, 0)][DBLP]
    STOC, 1992, pp:283-293 [Conf]
  4. Stephen A. Cook
    A Taxonomy of Problems with Fast Parallel Algorithms [Citation Graph (4, 0)][DBLP]
    Information and Control, 1985, v:64, n:1-3, pp:2-21 [Journal]
  5. Stephen A. Cook
    A Hierarchy for Nondeterministic Time Complexity [Citation Graph (1, 0)][DBLP]
    STOC, 1972, pp:187-192 [Conf]
  6. Stephen A. Cook
    An Overview of Computational Complexity. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:6, pp:400-408 [Journal]
  7. Stephen A. Cook
    Characterizations of Pushdown Machines in Terms of Time-Bounded Computers. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1971, v:18, n:1, pp:4-18 [Journal]
  8. Stephen A. Cook, Pierre McKenzie
    Problems Complete for Deterministic Logarithmic Space. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:3, pp:385-394 [Journal]
  9. Paul Beame, Stephen A. Cook, H. James Hoover
    Log Depth Circuits for Division and Related Problems. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:994-1003 [Journal]
  10. Stephen A. Cook
    Soundness and Completeness of an Axiom System for Program Verification. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:1, pp:70-90 [Journal]
  11. Stephen A. Cook, Yongmei Liu
    A Complete Axiomatization for Blocks World. [Citation Graph (0, 0)][DBLP]
    AMAI, 2002, pp:- [Conf]
  12. Irwin S. Pressman, Stephen A. Cook, Jan K. Pachl
    The optimal placement of replicas in a network using a read any - write all policy. [Citation Graph (0, 0)][DBLP]
    CASCON, 1992, pp:189-201 [Conf]
  13. Stephen A. Cook
    The Classifikation of Problems which have Fast Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:78-93 [Conf]
  14. Paul Beame, Stephen A. Cook, H. James Hoover
    Log Depth Circuits for Division and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:1-6 [Conf]
  15. Stephen A. Cook, Bruce M. Kapron
    Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:154-159 [Conf]
  16. Patrick W. Dymond, Stephen A. Cook
    Hardware Complexity and Parallel Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:360-372 [Conf]
  17. Bruce M. Kapron, Stephen A. Cook
    A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:342-347 [Conf]
  18. Pierre McKenzie, Stephen A. Cook
    The Parallel Complexity of the Abelian Permutation Group Membership Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:154-161 [Conf]
  19. Stephen A. Cook
    Complexity Classes, Propositional Proof Systems, and Formal Theories. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:311- [Conf]
  20. Stephen A. Cook, Antonina Kolokolova
    A Second-Order System for Polytime Reasoning Using Graedel's Theorem. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:177-186 [Conf]
  21. Stephen A. Cook, Antonina Kolokolova
    A Second-Order Theory for NL. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:398-407 [Conf]
  22. Stephen A. Cook, Neil Thapen
    The Strength of Replacement in Weak Arithmetic. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:256-264 [Conf]
  23. Phuong Nguyen, Stephen A. Cook
    VTC circ: A Second-Order Theory for TCcirc. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:378-387 [Conf]
  24. Michael Soltys, Stephen A. Cook
    The Proof Complexity of Linear Algebra. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:335-344 [Conf]
  25. Stephen A. Cook, Derek C. Oppen
    An Assertion Language for Data Structures. [Citation Graph (0, 0)][DBLP]
    POPL, 1975, pp:160-166 [Conf]
  26. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
    The relative complexity of NP search problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:303-314 [Conf]
  27. Allan Borodin, Stephen A. Cook
    On the Number of Additions to Compute Specific Polynomials (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:342-347 [Conf]
  28. Allan Borodin, Stephen A. Cook
    A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:294-301 [Conf]
  29. Stephen A. Cook
    Variations on Pushdown Machines (Detailed Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1969, pp:229-231 [Conf]
  30. Stephen A. Cook
    Path Systems and Language Recognition [Citation Graph (0, 0)][DBLP]
    STOC, 1970, pp:70-72 [Conf]
  31. Stephen A. Cook
    An Observation on Time-Storage Trade Off [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:29-33 [Conf]
  32. Stephen A. Cook
    Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:83-97 [Conf]
  33. Stephen A. Cook
    Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log Squared Space [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:338-345 [Conf]
  34. Stephen A. Cook, Robert A. Reckhow
    Time-Bounded Random Access Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:73-80 [Conf]
  35. Stephen A. Cook, Robert A. Reckhow
    On the Lengths of Proofs in the Propositional Calculus (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:135-148 [Conf]
  36. Stephen A. Cook, Alasdair Urquhart
    Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:107-112 [Conf]
  37. Derek C. Oppen, Stephen A. Cook
    Proving Assertions about Programs that Manipulate Data Structures [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:107-116 [Conf]
  38. Stephen A. Cook, Antonina Kolokolova
    A second-order system for polytime reasoning based on Grädel's theorem. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:124, n:1-3, pp:193-231 [Journal]
  39. Stephen A. Cook, Alasdair Urquhart
    Functional Interpretations of Feasibly Constructive Arithmetic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:63, n:2, pp:103-200 [Journal]
  40. Michael Soltys, Stephen A. Cook
    The proof complexity of linear algebra. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:130, n:1-3, pp:277-323 [Journal]
  41. Stephen Bellantoni, Stephen A. Cook
    A New Recursion-Theoretic Characterization of the Polytime Functions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:97-110 [Journal]
  42. Stephen A. Cook, Patrick W. Dymond
    Parallel Pointer Machines. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:19-30 [Journal]
  43. Stephen A. Cook, Neil Thapen
    The strength of replacement in weak arithmetic [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  44. Stephen A. Cook, Jan K. Pachl, Irwin S. Pressman
    The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:1, pp:57-66 [Journal]
  45. Stephen A. Cook, Antonina Kolokolova
    A second-order system for polynomial-time reasoning based on Graedel's theorem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:24, pp:- [Journal]
  46. Allan Borodin, Stephen A. Cook, Nicholas Pippenger
    Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:58, n:1-3, pp:113-136 [Journal]
  47. Stephen A. Cook, Russell Impagliazzo, Tomoyuki Yamakami
    A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:137, n:2, pp:159-170 [Journal]
  48. Patrick W. Dymond, Stephen A. Cook
    Complexity Theory of Parallel Time and Hardware [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:80, n:3, pp:205-226 [Journal]
  49. Stephen A. Cook
    Short Propositional Formulas Represent Nondeterministic Computations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:26, n:5, pp:269-270 [Journal]
  50. Stephen A. Cook, Michael Luby
    A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:3, pp:141-145 [Journal]
  51. Stephen A. Cook, Toniann Pitassi
    A Feasibly Constructive Lower Bound for Resolution Proofs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:2, pp:81-85 [Journal]
  52. Stephen A. Cook
    The importance of the P versus NP question. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:1, pp:27-29 [Journal]
  53. Stephen A. Cook
    The Solvability of the Derivability Problem for One-Normal Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1966, v:13, n:2, pp:223-225 [Journal]
  54. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
    The Relative Complexity of NP Search Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:1, pp:3-19 [Journal]
  55. Stephen A. Cook
    A Hierarchy for Nondeterministic Time Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1973, v:7, n:4, pp:343-353 [Journal]
  56. Stephen A. Cook, Robert A. Reckhow
    Time Bounded Random Access Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1973, v:7, n:4, pp:354-375 [Journal]
  57. Stephen A. Cook, Ravi Sethi
    Storage Requirements for Deterministic Polynomial Time Recognizable Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:13, n:1, pp:25-37 [Journal]
  58. Armin Haken, Stephen A. Cook
    An Exponential Lower Bound for the Size of Monotone Real Circuits. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:2, pp:326-335 [Journal]
  59. Stephen A. Cook, Robert A. Reckhow
    The Relative Efficiency of Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:1, pp:36-50 [Journal]
  60. Phuong Nguyen, Stephen A. Cook
    Theories for TC0 and Other Small Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:1, pp:- [Journal]
  61. Stephen A. Cook, Yongmei Liu
    A Complete Axiomatization for Blocks World. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2003, v:13, n:4, pp:581-594 [Journal]
  62. Allan Borodin, Stephen A. Cook
    On the Number of Additions to Compute Specific Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:1, pp:146-157 [Journal]
  63. Allan Borodin, Stephen A. Cook
    A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:287-297 [Journal]
  64. Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
    Two Applications of Inductive Counting for Complementation Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:559-578 [Journal]
  65. Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
    Erratum: Two Applications of Inductive Counting for Complementation Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:6, pp:1283- [Journal]
  66. Stephen A. Cook
    Corrigendum: Soundness and Completeness of an Axiom System for Program Verification. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:612- [Journal]
  67. Stephen A. Cook, H. James Hoover
    A Depth-Universal Circuit. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:833-839 [Journal]
  68. Stephen A. Cook, Charles Rackoff
    Space Lower Bounds for Maze Threadability on Restricted Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:636-652 [Journal]
  69. Pierre McKenzie, Stephen A. Cook
    The Parallel Complexity of Abelian Permutation Group Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:5, pp:880-909 [Journal]
  70. Stephen A. Cook, Neil Thapen
    The strength of replacement in weak arithmetic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:4, pp:749-764 [Journal]
  71. Phuong Nguyen, Stephen A. Cook
    The Complexity of Proving the Discrete Jordan Curve Theorem. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:245-256 [Conf]

  72. Fractional Pebbling and Thrifty Branching Programs. [Citation Graph (, )][DBLP]


  73. Branching Programs for Tree Evaluation. [Citation Graph (, )][DBLP]


  74. Computing over the Reals: Foundations for Scientific Computing [Citation Graph (, )][DBLP]


  75. Pebbles and Branching Programs for Tree Evaluation [Citation Graph (, )][DBLP]


Search in 0.334secs, Finished in 0.337secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002