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 James Aspnes'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 James Aspnes with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites James Aspnes more than expected).
This network shows the impact of papers produced by James Aspnes. 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 James Aspnes. The network helps show where James Aspnes may publish in the future.
Co-authorship network of co-authors of James Aspnes
This figure shows the co-authorship network connecting the top 25 collaborators of James Aspnes.
A scholar is included among the top collaborators of James Aspnes 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 James Aspnes. James Aspnes is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Faleiro, Jose M., Juno Kim, Daniel J. Abadi, et al.. (2018). The fuzzylog: a partially ordered shared log. Operating Systems Design and Implementation. 357–372.9 indexed citations
Angluin, Dana, James Aspnes, Chen Jiang, David Eisenstat, & Lev Reyzin. (2008). Learning Acyclic Probabilistic Circuits Using Test Paths. Journal of Machine Learning Research. 10(65). 169–180.1 indexed citations
7.
Aspnes, James & Eric Ruppert. (2007). An Introduction to Population Protocols.. Bulletin of the European Association for Theoretical Computer Science. 93. 98–117.45 indexed citations
8.
Aspnes, James, Joan Feigenbaum, Aleksandr Yampolskiy, & Sheng Zhong. (2007). Towards a theory of data entanglement. Theoretical Computer Science. 389(1-2). 26–43.12 indexed citations
Angluin, Dana, James Aspnes, & David Eisenstat. (2006). Fast computation by population protocols with a leader.1 indexed citations
11.
Aspnes, James, Costas Busch, Shlomi Dolev, et al.. (2006). Eight Open Problems in Distributed Computing. Bulletin of the European Association for Theoretical Computer Science. 90. 109–126.7 indexed citations
Angluin, Dana, James Aspnes, & David Eisenstat. (2005). On the power of anonymous one-way communication.1 indexed citations
14.
Aguilera, Marcos K. & James Aspnes. (2005). Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing.15 indexed citations
Aspnes, James & Orli Waarts. (1995). A Modular Measure of Competitiveness for Distributed Algorithms (Abstract).. 252.4 indexed citations
20.
Aspnes, James, Alan Fekete, Nancy Lynch, Michael Merritt, & William E. Weihl. (1988). A Theory of Timestamp-Based Concurrency Control for Nested Transactions. Very Large Data Bases. 431–444.12 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.