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.
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).
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
20 of 20 papers shown
1.
Filmus, Yuval, et al.. (2013). Average Case Lower Bounds for Monotone Switching Networks.. Electronic colloquium on computational complexity. 20. 54.1 indexed citations
2.
Cook, Stephen, et al.. (2012). Formal Theories for Linear Algebra. Logical Methods in Computer Science. Volume 8, Issue 1.2 indexed citations
3.
Cook, Stephen. (2007). Relating the Provable Collapse of P to NC¹ and the Power of Logical Theories.1 indexed citations
Braverman, Mark & Stephen Cook. (2005). Computing over the Reals: Foundations for Scientific Computing. Notices of the American Mathematical Society. 53(3). 318–329.31 indexed citations
Soltys, Michael & Stephen Cook. (2004). The proof complexity of linear algebra. Annals of Pure and Applied Logic. 130(1-3). 277–323.17 indexed citations
Pressman, Irwin S., Stephen Cook, & Jan Pachl. (1992). The optimal placement of replicas in a network using a READ ANY - WRITE ALL policy. Conference of the Centre for Advanced Studies on Collaborative Research. 189–201.3 indexed citations
13.
Cook, Stephen. (1990). Computational complexity of higher type functions.5 indexed citations
Dymond, Patrick & Stephen Cook. (1980). Hardware Complexity and Parallel Computation (Preliminary Version). 163(10). 360–372.1 indexed citations
17.
Anderson, Donald L., Stephen Cook, Anton M. Dainty, et al.. (1978). Viking Martian Seismology: a Summary of Current Status. LPI. 13–14.1 indexed citations
18.
Cook, Stephen. (1971). Linear Time Simulation of Deterministic Two-Way Pushdown Automata.. IFIP Congress. 75–80.51 indexed citations
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.