Fellow
Canada – 2008
CITATION

For fundamental contributions to the theory of computational complexity.

ACM A. M. Turing Award
Canada – 1982
READ FULL CITATION AND ESSAY
CITATION
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.