BibSLEIGH — Stephen_A

Travelled to:

1 × Czech Republic
1 × Denmark
1 × Finland
1 × France
1 × Italy
1 × Norway
1 × Poland
1 × Switzerland
15 × USA
2 × Canada

Collaborated with:

∅ P.Nguyen A.Kolokolova A.Borodin D.C.Oppen R.A.Reckhow D.T.M.Le K.Ghasemloo L.Fontes A.Kawamura N.Thapen M.Soltys S.Bellantoni A.Urquhart C.Dwork R.Sethi Y.Ye K.Aehlig P.Beame J.Edmonds R.Impagliazzo T.Pitassi

Talks about:

complex (10) theori (9) time (7) proof (6) formal (5) proposit (4) system (4) class (4) polynomi (3) function (3)

Person: Stephen A. Cook

DBLP: Cook:Stephen_A=

Contributed to:

2013

2012

2011

2010

2007

2004

2002

2001

1995

1992

1989

1982

1980

1979

1975

1974

1973

1972

1971

1970

1969

Wrote 32 papers:

CSL-2013-GhasemlooC #bound #proving: Theories for Subexponential-size Bounded-depth Frege Proofs (KG, SAC), pp. 296–315.
CSL-2012-Cook #complexity #proving: Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (SAC), pp. 9–11.
CSL-2011-LeCY #complexity #formal method #problem: A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem (DTML, SAC, YY), pp. 381–395.
LICS-2011-LeC #algorithm #formal method #random: Formalizing Randomized Matching Algorithms (DTML, SAC), pp. 185–194.
CSL-2010-CookF #algebra #linear: Formal Theories for Linear Algebra (SAC, LF), pp. 245–259.
STOC-2010-KawamuraC #analysis #complexity: Complexity theory for operators in analysis (AK, SAC), pp. 495–502.
CSL-2007-AehligCN #complexity: Relativizing Small Complexity Classes and Their Theories (KA, SAC, PN), pp. 374–388.
LICS-2007-NguyenC #complexity #proving #theorem: The Complexity of Proving the Discrete Jordan Curve Theorem (PN, SAC), pp. 245–256.
LICS-2004-CookK #higher-order: A Second-Order Theory for NL (SAC, AK), pp. 398–407.
LICS-2004-CookT: The Strength of Replacement in Weak Arithmetic (SAC, NT), pp. 256–264.
LICS-2004-NguyenC #higher-order: VTC circ: A Second-Order Theory for TCcirc (PN, SAC), pp. 378–387.
LICS-2002-Cook #complexity #proving: Complexity Classes, Propositional Proof Systems, and Formal Theories (SAC), p. 311.
LICS-2002-SoltysC #algebra #complexity #linear #proving: The Proof Complexity of Linear Algebra (MS, SAC), pp. 335–344.
LICS-2001-CookK #higher-order #reasoning #theorem #using: A Second-Order System for Polytime Reasoning Using Graedel’s Theorem (SAC, AK), pp. 177–186.
STOC-1995-BeameCEIP #complexity #problem: The relative complexity of NP search problems (PB, SAC, JE, RI, TP), pp. 303–314.
STOC-1992-BellantoniC #recursion: A New Recursion-Theoretic Characterization of the Polytime Functions (SB, SAC), pp. 283–293.
STOC-1989-CookU #functional: Functional Interpretations of Feasibly Constructive Arithmetic (SAC, AU), pp. 107–112.
STOC-1982-CookD #bound #parallel #ram: Bounds on the Time for Parallel RAM’s to Compute Simple Functions (SAC, CD), pp. 231–233.
STOC-1980-BorodinC #sorting #trade-off: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation (AB, SAC), pp. 294–301.
STOC-1979-Cook #polynomial: Deterministic CFL’s Are Accepted Simultaneously in Polynomial Time and Log Squared Space (SAC), pp. 338–345.
POPL-1975-CookO #data type: An Assertion Language for Data Structures (SAC, DCO), pp. 160–166.
STOC-1975-Cook #calculus #proving: Feasibly Constructive Proofs and the Propositional Calculus (SAC), pp. 83–97.
STOC-1975-OppenC #data type #proving #source code: Proving Assertions about Programs that Manipulate Data Structures (DCO, SAC), pp. 107–116.
STOC-1974-BorodinC #on the: On the Number of Additions to Compute Specific Polynomials (AB, SAC), pp. 342–347.
STOC-1974-CookR #calculus #on the #proving: On the Lengths of Proofs in the Propositional Calculus (SAC, RAR), pp. 135–148.
STOC-1974-CookS #polynomial #requirements: Storage Requirements for Deterministic Polynomial Time Recognizable Languages (SAC, RS), pp. 33–39.
STOC-1973-Cook: An Observation on Time-Storage Trade Off (SAC), pp. 29–33.
STOC-1972-Cook #complexity #nondeterminism: A Hierarchy for Nondeterministic Time Complexity (SAC), pp. 187–192.
STOC-1972-CookR #bound #random: Time-Bounded Random Access Machines (SAC, RAR), pp. 73–80.
STOC-1971-Cook #complexity: The Complexity of Theorem-Proving Procedures (SAC), pp. 151–158.
STOC-1970-Cook #recognition: Path Systems and Language Recognition (SAC), pp. 70–72.
STOC-1969-Cook #automaton: Variations on Pushdown Machines (SAC), pp. 229–231.