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.
Citations per year, relative to Tony Hoare Tony Hoare (= 1×)
peers
Edsger W. Dijkstra
Countries citing papers authored by Tony Hoare
Since
Specialization
Citations
This map shows the geographic impact of Tony Hoare'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 Tony Hoare with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tony Hoare more than expected).
This network shows the impact of papers produced by Tony Hoare. 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 Tony Hoare. The network helps show where Tony Hoare may publish in the future.
Co-authorship network of co-authors of Tony Hoare
This figure shows the co-authorship network connecting the top 25 collaborators of Tony Hoare.
A scholar is included among the top collaborators of Tony Hoare 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 Tony Hoare. Tony Hoare is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hoare, Tony. (1976). Remarks on “Program Proving: Jumps and Functions”. Acta Informatica. 6(3).9 indexed citations
15.
Hoare, Tony. (1974). Consistent and Complementary Formal Theories of the Semantics of Programming Languages. Acta Informatica. 3(2).21 indexed citations
16.
Hoare, Tony. (1974). Optimisation of Store Size for Garbage Collection. Information Processing Letters. 2(6).3 indexed citations
17.
Hoare, Tony. (1972). Prospects for a Better Programming Language. 7.1 indexed citations
18.
Hoare, Tony. (1968). An Axiomatic Basis for Computer Programming. Communications of the ACM. 12(10).101 indexed citations
19.
Hoare, Tony. (1968). Critique of ALGOL 68. 29.1 indexed citations
20.
Hoare, Tony. (1961). Algorithm 63‚ Partition; Algorithm 64‚ Quicksort; Algorithm 65‚ Find. Communications of the ACM. 4(7).19 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.