Stephen Cook

15.6k total citations · 1 hit paper
133 papers, 7.7k citations indexed

About

Stephen Cook is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Stephen Cook has authored 133 papers receiving a total of 7.7k indexed citations (citations by other indexed papers that have themselves been cited), including 100 papers in Computational Theory and Mathematics, 70 papers in Artificial Intelligence and 18 papers in Computer Networks and Communications. Recurrent topics in Stephen Cook's work include Complexity and Algorithms in Graphs (37 papers), Computability, Logic, AI Algorithms (36 papers) and semigroups and automata theory (30 papers). Stephen Cook is often cited by papers focused on Complexity and Algorithms in Graphs (37 papers), Computability, Logic, AI Algorithms (36 papers) and semigroups and automata theory (30 papers). Stephen Cook collaborates with scholars based in Canada, United States and United Kingdom. Stephen Cook's co-authors include Robert A. Reckhow, Allan Borodin, Stål Aanderaa, Cynthia Dwork, Stephen J. Bellantoni, Paul Beame, Rüdiger Reischuk, Pierre McKenzie, Patrick Dymond and H. James Hoover and has published in prestigious journals such as Journal of Clinical Oncology, Communications of the ACM and Journal of the ACM.

In The Last Decade

Stephen Cook

127 papers receiving 6.8k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

The complexity of theorem-proving procedures

1971 3.1k citations Stephen Cook profile →

Peers

Countries citing papers authored by Stephen Cook

Since Specialization

Citations

This map shows the geographic impact of Stephen Cook's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stephen Cook with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stephen Cook more than expected).

Fields of papers citing papers by Stephen Cook

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stephen Cook. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stephen Cook. The network helps show where Stephen Cook may publish in the future.

Co-authorship network of co-authors of Stephen Cook

This figure shows the co-authorship network connecting the top 25 collaborators of Stephen Cook. A scholar is included among the top collaborators of Stephen Cook based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stephen Cook. Stephen Cook is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Average Case Lower Bounds for Monotone Switching Networks. 2013 ·Electronic colloquium on computational complexity ·Yuval Filmus, Toniann Pitassi, (unknown), Stephen Cook	1
2	Formal Theories for Linear Algebra 2012 ·Logical Methods in Computer Science ·Stephen Cook, (unknown)	2
3	Relating the Provable Collapse of P to NC¹ and the Power of Logical Theories 2007 ·Stephen Cook	1
4	Computing over the Reals: Foundations for Scientific Computing 2005 ·Notices of the American Mathematical Society ·Mark Braverman, Stephen Cook	31
5	VTC: A Second-Order Theory for TC 2004 ·Phuong Nguyen, Stephen Cook	4
6	A second-order system for polynomial-time reasoning based on Graedel's theorem 2001 ·Electronic colloquium on computational complexity ·Stephen Cook, (unknown)	1
7	Efficiently Approximable Real-Valued Functions 2000 ·Electronic colloquium on computational complexity ·Valentine Kabanets, Charles Rackoff, Stephen Cook	11
8	An Exponential Lower Bound for the Size of Monotone Real Circuits 1999 ·Journal of Computer and System Sciences ·(unknown), Stephen Cook	32
9	Functional interpretations of feasibly constructive arithmetic 1993 ·Annals of Pure and Applied Logic ·Stephen Cook, Alasdair Urquhart	58
10	The optimal placement of replicas in a network using a READ ANY - WRITE ALL policy 1992 ·Conference of the Centre for Advanced Studies on Collaborative Research ·Irwin S. Pressman, Stephen Cook, Jan Pachl	3
11	Computational complexity of higher type functions 1990 ·Stephen Cook	5
12	Complexity theory of parallel time and hardware 1989 ·Information and Computation ·Patrick Dymond, Stephen Cook	14
13	Hardware Complexity and Parallel Computation (Preliminary Version) 1980 ·Patrick Dymond, Stephen Cook	1
14	Viking Martian Seismology: a Summary of Current Status 1978 ·LPI ·Donald L. Anderson, Stephen Cook, Anton M. Dainty, F. K. Duennebier, N. R. Goins, R. L. Kovach, Gary V. Latham	1
15	Storage requirements for deterministic polynomialtime recognizable languages 1976 ·Journal of Computer and System Sciences ·Stephen Cook, Ravi Sethi	65
16	An observation on time-storage trade off 1974 ·Journal of Computer and System Sciences ·Stephen Cook	127
17	Time bounded random access machines 1973 ·Journal of Computer and System Sciences ·Stephen Cook, Robert A. Reckhow	165
18	Linear Time Simulation of Deterministic Two-Way Pushdown Automata. 1971 ·IFIP Congress ·Stephen Cook	51
19	On the minimum computation time of functions 1969 ·Transactions of the American Mathematical Society ·Stephen Cook, Stål Aanderaa	159
20	On the Minimum Computation Time of Functions 1969 ·Transactions of the American Mathematical Society ·Stephen Cook, Stål Aanderaa	36

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact