Stephen Cook

University of Toronto

H-index: 52

North America-Canada

About Stephen Cook

Stephen Cook, With an exceptional h-index of 52 and a recent h-index of 26 (since 2020), a distinguished researcher at University of Toronto, specializes in the field of Computational Complexity, Proof Complexity.

His recent articles reflect a diverse array of research interests and contributions to the field:

The 1982 ACM Turing Award Lecture: An Overview of Computational Complexity

A survey of classes of primitive recursive functions

A time-space tradeoff for sorting on a general sequential model of computation

Towards a complexity theory of synchronous parallel computation

Feasibly constructive proofs and the propositional calculus (preliminary version)

Characterizations of pushdown machines in terms of time-bounded computers

The relative efficiency of propositional proof systems

The complexity of theorem-proving procedures

Stephen Cook Information

University	University of Toronto
Position	Department of Computer Science
Citations(all)	25116
Citations(since 2020)	4703
Cited By	22745
hIndex(all)	52
hIndex(since 2020)	26
i10Index(all)	94
i10Index(since 2020)	50
Email	Access Email
University Profile Page	University of Toronto
Google Scholar	View Google Scholar Profile

Stephen Cook Skills & Research Interests

Computational Complexity

Proof Complexity

Stephen Cook

University of Toronto

About Stephen Cook

Stephen Cook Information

Stephen Cook Skills & Research Interests

Top articles of Stephen Cook

The 1982 ACM Turing Award Lecture: An Overview of Computational Complexity

A survey of classes of primitive recursive functions

A time-space tradeoff for sorting on a general sequential model of computation

Allan Borodin

Stephen Cook

Towards a complexity theory of synchronous parallel computation

Feasibly constructive proofs and the propositional calculus (preliminary version)

Characterizations of pushdown machines in terms of time-bounded computers

The relative efficiency of propositional proof systems

The complexity of theorem-proving procedures

CS 4995 Notes Fall, 2022

The complexity of theorem-proving procedures (1971)

Uniform, integral, and feasible proofs for the determinant identities