Stephen CookUniversity of Toronto
H-Index & Metrics
|Number of Google Citations||20,145|
|Guide2Research World Ranking||1650th|
|Guide2Research National Ranking (Canada)||67th|
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.
View other scientists in:
Profile was last updated at May 17, 2019, 6:10 pm
Guide2Research Ranking is based on Google Scholar H-Index.