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 Brian Noble'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 Brian Noble with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Brian Noble more than expected).
This network shows the impact of papers produced by Brian Noble. 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 Brian Noble. The network helps show where Brian Noble may publish in the future.
Co-authorship network of co-authors of Brian Noble
This figure shows the co-authorship network connecting the top 25 collaborators of Brian Noble.
A scholar is included among the top collaborators of Brian Noble 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 Brian Noble. Brian Noble 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.
Flinn, Jason, et al.. (2017). Gremlin. 1–13.12 indexed citations
Xu, Yunjing, et al.. (2013). Bobtail: avoiding long tails in the cloud. Networked Systems Design and Implementation. 329–342.129 indexed citations
4.
Veeraraghavan, Kaushik, Jason Flinn, Edmund B. Nightingale, & Brian Noble. (2010). quFiles: the right file at the right time. File and Storage Technologies. 1–1.3 indexed citations
Mickens, James, John R. Douceur, William J. Bolosky, & Brian Noble. (2009). StrobeLight: lightweight availability mapping and anomaly detection. USENIX Annual Technical Conference. 5–5.8 indexed citations
Nicholson, Anthony J. & Brian Noble. (2008). BreadCrumbs. 46–57.258 indexed citations
9.
Veeraraghavan, Kaushik, Edmund B. Nightingale, Jason Flinn, & Brian Noble. (2008). quFiles. 65–68.4 indexed citations
10.
Shah, Sam, Craig A. N. Soules, Gregory R. Ganger, & Brian Noble. (2007). Using provenance to aid in personal file search. USENIX Annual Technical Conference. 13.37 indexed citations
11.
Mickens, James & Brian Noble. (2006). Exploiting availability prediction in distributed systems. Networked Systems Design and Implementation. 6–6.97 indexed citations
Shin, Kang G., David Kotz, & Brian Noble. (2005). Proceedings of the 3rd international conference on Mobile systems, applications, and services.3 indexed citations
Kim, Minkyong, Landon P. Cox, & Brian Noble. (2002). Safety, Visibility, and Performance in a Wide-Area File System. File and Storage Technologies. 131–144.24 indexed citations
Satyanarayanan, Mahadev, Brian Noble, Puneet Kumar, & Morgan N. Price. (1995). Application-aware adaptation for mobile computing. ACM SIGOPS Operating Systems Review. 29(1). 52–55.24 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.