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.
A nation at risk
19832.6k citationsPeter J. DenningCommunications of the ACMprofile →
Certification of programs for secure information flow
1977605 citationsPeter J. Denning et al.Communications of the ACMprofile →
Citations per year, relative to Peter J. Denning Peter J. Denning (= 1×)
peers
Jeannette M. Wing
Countries citing papers authored by Peter J. Denning
Since
Specialization
Citations
This map shows the geographic impact of Peter J. Denning'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 Peter J. Denning with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter J. Denning more than expected).
Fields of papers citing papers by Peter J. Denning
This network shows the impact of papers produced by Peter J. Denning. 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 Peter J. Denning. The network helps show where Peter J. Denning may publish in the future.
Co-authorship network of co-authors of Peter J. Denning
This figure shows the co-authorship network connecting the top 25 collaborators of Peter J. Denning.
A scholar is included among the top collaborators of Peter J. Denning 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 Peter J. Denning. Peter J. Denning 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.
Denning, Peter J. & Ted G. Lewis. (2024). An AI Learning Hierarchy. Communications of the ACM. 67(12). 24–27.1 indexed citations
2.
Denning, Peter J.. (2006). The Profession of IT, Infoglut. Communications of the ACM. 49(7). 15–19.3 indexed citations
3.
Denning, Peter J., et al.. (2001). The Core of the Third-Wave Professional. Communications of the ACM. 44. 21–25.22 indexed citations
4.
Noble, David W., et al.. (1998). Technology in Education: The Fight for the Future.. 33(3).8 indexed citations
5.
Denning, Peter J.. (1997). The Internet after thirty years. 15–27.1 indexed citations
6.
Denning, Peter J.. (1991). In the Queue: Mean Values. American Scientist. 79. 402.1 indexed citations
7.
Denning, Peter J.. (1989). The science of computing. American Scientist. 77(4). 333–335.21 indexed citations
8.
Denning, Peter J.. (1989). Stopping computer crimes. American Scientist. 78(1). 16–24.68 indexed citations
9.
Denning, Peter J.. (1988). Massive parallelism in the future of science. NASA STI Repository (National Aeronautics and Space Administration). 77(1). 16–18.2 indexed citations
10.
Denning, Peter J.. (1987). A New Paradigm for Science. 75(6). 379–382.
11.
Denning, Peter J.. (1987). Security of Data in Networks. 75(1). 12–17.4 indexed citations
12.
Denning, Peter J.. (1987). Baffling Big Brother. American Scientist. 75(5). 464–466.
13.
Denning, Peter J.. (1986). The Science of Computing: Virtual Memory. American Scientist. 74(3).1 indexed citations
14.
Denning, Peter J.. (1985). The Arbitration Problem. 73(6). 516–518.1 indexed citations
15.
Denning, Peter J.. (1985). The science of computing - Parallel computation. American Scientist. 73.3 indexed citations
16.
Denning, Peter J., et al.. (1983). Operational State Sequence Analysis. Purdue e-Pubs (Purdue University System). 269–283.1 indexed citations
17.
Balbo, Gianfranco & Peter J. Denning. (1979). Homogeneous Approximations of General Queueing Networks. Purdue e-Pubs (Purdue University System). 353–374.6 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.