World's Best Scientists 2026 revealed!
Stephen A. Cook

Stephen A. Cook

D-Index & Metrics

Computer Science

D-Index
54
Citations
23988
World Ranking
4436
National Ranking
177

Research.com Recognitions

  • 2008 - ACM Fellow For fundamental contributions to the theory of computational complexity.
  • 1986 - Fellow of the American Academy of Arts and Sciences
  • 1985 - Member of the National Academy of Sciences
  • 1982 - 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.

Overview

Stephen A. Cook is affiliated with the University of Toronto in Canada. Their research spans multiple fields within medicine, with a notable focus on computational theory and mathematics as well as economics, epidemiology, health, and cardiology.

Their recent papers cover various topics, including congenital heart surgery outcomes, proof techniques in mathematics, and AI applications in medical treatments. Notable publications include:

  • Impact of Social Determinants of Health on Predictive Models for Outcomes After Congenital Heart Surgery, 2024, Journal of the American College of Cardiology
  • Uniform, Integral, and Feasible Proofs for the Determinant Identities, 2021, Journal of the ACM
  • Long-Term Healthcare Utilization in Patients Undergoing Congenital Heart Surgery: A 10-Year Statewide Analysis, 2022, Journal of the American College of Cardiology
  • Hydrogeology of the Beetaloo GBA Region. Technical Appendix for the Geological and Bioregional Assessment Program: Stage 2, 2020, CSIRO
  • Gemcitabine Response Prediction in the Adjuvant Treatment of Resected Pancreatic Ductal Adenocarcinoma Using an AI Histopathology Platform, 2022, Journal of Clinical Oncology

The scientist often collaborates with colleagues including Sarah Crook, Kacie Dragan, Joyce Woo, Matthew Neidell, and Edward L. Hannan. Their frequent publication venues reflect their interdisciplinary reach, featuring journals such as:

  • Journal of the American College of Cardiology
  • Journal of the ACM
  • CSIRO
  • Journal of Clinical Oncology
  • arXiv (Cornell University)

Stephen A. Cook's work addresses main topics such as healthcare policy and management, congenital heart disease studies, and health disparities and outcomes. Their research also includes areas related to cardiac anesthesia and surgical outcomes, complexity and algorithms in graphs, advanced graph theory research, and computability, logic, and AI algorithms.

  • Healthcare Policy and Management
  • Congenital Heart Disease Studies
  • Health Disparities and Outcomes
  • Cardiac, Anesthesia and Surgical Outcomes
  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Computability, Logic, AI Algorithms

Cook's contributions have been recognized with several awards, including the ACM Fellow in 2008 for fundamental contributions to computational complexity theory. They were named a Fellow of the American Academy of Arts and Sciences in 1986 and became a member of the National Academy of Sciences in 1985. In 1982, Cook received the A. M. Turing Award for advancing the understanding of the complexity of computation, particularly through their seminal paper on the complexity of theorem proving procedures, which laid the groundwork for the theory of NP-completeness.

Best Publications

  • The complexity of theorem-proving procedures

    Stephen A. Cook

  • The relative efficiency of propositional proof systems

    Stephen A. Cook;Robert A. Reckhow

  • A taxonomy of problems with fast parallel algorithms

    Stephen A. Cook

  • A new recursion-theoretic characterization of the polytime functions

    Stephen Bellantoni;Stephen Cook

  • SOUNDNESS AND COMPLETENESS OF AN AXIOM SYSTEM FOR PROGRAM VERIFICATION

    Stephen A. Cook

  • An observation on time-storage trade off

    Stephen A. Cook

  • Cobham Alan. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress , edited by Bar-Hillel Yehoshua, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp. 24–30.

    Stephen A. Cook

  • Time bounded random access machines

    Stephen A. Cook;Robert A. Reckhow

  • ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS

    Stephen A. Cook;Stȧl O. Aanderaa

  • Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

    Stephen A. Cook

  • Upper and lower time bounds for parallel random access machines without simultaneous writes

    Stephen Cook;Cynthia Dwork;Ru duml;ger Reischuk

  • A hierarchy for nondeterministic time complexity

    Stephen A. Cook

  • Log depth circuits for division and related problems

    Paul W Beame;Stephen A Cook;H James Hoover

  • Finding hard instances of the satisfiability problem: A survey.

    Stephen A. Cook;David G. Mitchell

  • Feasibly constructive proofs and the propositional calculus (Preliminary Version)

    Stephen A. Cook

  • Logical Foundations of Proof Complexity

    Stephen Cook;Phuong Nguyen

  • Functional interpretations of feasibly constructive arithmetic

    Stephen A. Cook;Alasdair Urquhart

  • Problems complete for deterministic logarithmic space

    Stephen A. Cook;Pierre McKenzie

  • A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation

    Allan Borodin;Stephen A. Cook

  • An overview of computational complexity

    Stephen A. Cook

  • Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions

    Stephen A. Cook

Frequent Co-Authors

Toniann Pitassi
Toniann Pitassi Columbia University
Allan Borodin
Allan Borodin University of Toronto
Mark Braverman
Mark Braverman Princeton University
Paul Beame
Paul Beame University of Washington
Russell Impagliazzo
Russell Impagliazzo University of California, San Diego
Martin Tompa
Martin Tompa University of Washington
Cynthia Dwork
Cynthia Dwork Harvard University
Walter L. Ruzzo
Walter L. Ruzzo University of Washington
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics
Michael Luby
Michael Luby BitRipple

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As you consider pursuing Computer Science in the USA, it's valuable to explore related online degrees that can expand your career options. Many students opt to complement their tech education with studies in areas that intersect with technology or enhance leadership opportunities.

For those interested in law and security, a criminal justice online degree provides foundational knowledge about the legal system and cybersecurity practices—key skills in digital forensics and cybercrime prevention.

If you have a knack for numbers, an accounting degree online can open doors in data analysis, fintech, and financial software development. Similarly, a specialized online master data science equips you with advanced skills in big data, machine learning, and AI—fields closely linked with computer science innovation.

Lastly, combining technology and leadership, the best construction management schools offer programs that merge project management, engineering, and digital skills—ideal for students intent on tech-driven careers in construction and development.

Best Scientists Citing Stephen A. Cook

Trending Scientists

Recently Published Articles