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 DaCapo benchmarks
20061.1k citationsStephen M. Blackburn, Robin Garner et al.ANU Open Research (Australian National University)profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Antony L. Hosking
Since
Specialization
Citations
This map shows the geographic impact of Antony L. Hosking'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 Antony L. Hosking with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Antony L. Hosking more than expected).
Fields of papers citing papers by Antony L. Hosking
This network shows the impact of papers produced by Antony L. Hosking. 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 Antony L. Hosking. The network helps show where Antony L. Hosking may publish in the future.
Co-authorship network of co-authors of Antony L. Hosking
This figure shows the co-authorship network connecting the top 25 collaborators of Antony L. Hosking.
A scholar is included among the top collaborators of Antony L. Hosking 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 Antony L. Hosking. Antony L. Hosking 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.
Wang, Kunshan, Stephen M. Blackburn, Antony L. Hosking, & Michael Norrish. (2018). Hop, Skip, & Jump. ACM SIGPLAN Notices. 53(3). 1–16.2 indexed citations
Hosking, Antony L. & Patrick Eugster. (2013). Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity.4 indexed citations
Hosking, Antony L., David F. Bacon, & Orran Krieger. (2009). Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments.5 indexed citations
7.
Kalibera, Tomáš, Filip Pizlo, Antony L. Hosking, & Jan Vítek. (2009). Scheduling Hard Real-Time Garbage Collection. ANU Open Research (Australian National University). 81–92.15 indexed citations
Blackburn, Stephen M., Robin Garner, Kathryn S. McKinley, et al.. (2006). The DaCapo benchmarks. ANU Open Research (Australian National University). 169–190.1139 indexed citations breakdown →
VanDrunen, Thomas, Antony L. Hosking, & Jens Palsberg. (2000). Reducing Loads and Stores in Stack Architectures.5 indexed citations
14.
Hosking, Antony L., et al.. (1999). PM3: An Orthogonal Persistent Systems Programming Language - Design, Implementation, Performance. Very Large Data Bases. 587–598.11 indexed citations
15.
Hosking, Antony L., et al.. (1998). Optimizing the Read and Write Barriers for Orthogonal Persistence. 149–159.6 indexed citations
16.
Nystrom, Nathaniel, et al.. (1998). Swizzle Barrier Optimizations for Orthogonal Persistence in Java. 268–278.3 indexed citations
17.
Cutts, Quintin & Antony L. Hosking. (1997). Analysing, Profiling and Optimising Orthogonal Persistence for Java.2 indexed citations
18.
Hosking, Antony L., Eric W. Brown, & J. Eliot B. Moss. (1993). Update Logging for Persistent Programming Languages: A Comparative Performance Evaluation. Very Large Data Bases. 429–440.12 indexed citations
Hosking, Antony L., et al.. (1990). Design of an Object Faulting Persistent Smalltalk.8 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.