Stephen Cook

University of Toronto
Canada

G2R World Ranking 2549th

G2R Canada Ranking 114th

H-Index & Metrics

Google H-index 51
Number of Google Citations 21,873
Number of Articles on DBLP 120

Awards & Achievements

  • 2008 - ACM Fellow For fundamental contributions to the theory of computational complexity.
  • 1982 - Turing Award
  • 1982 - ACM A. M. Turing Award For his advancement of our understanding of the complexity of computation in a significant and profound way. His seminal paper, "The Complexity of Theorem Proving Procedures," presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness. The ensuing exploration of the boundaries and nature of NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade.
Profile was last updated at July 17, 2020, 1:55 pm
Guide2Research Ranking is based on Google Scholar H-Index.
Report Missing or Incorrect Information