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.
Countries citing papers authored by Rodrigo Rodrigues
Since
Specialization
Citations
This map shows the geographic impact of Rodrigo Rodrigues'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 Rodrigo Rodrigues with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rodrigo Rodrigues more than expected).
Fields of papers citing papers by Rodrigo Rodrigues
This network shows the impact of papers produced by Rodrigo Rodrigues. 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 Rodrigo Rodrigues. The network helps show where Rodrigo Rodrigues may publish in the future.
Co-authorship network of co-authors of Rodrigo Rodrigues
This figure shows the co-authorship network connecting the top 25 collaborators of Rodrigo Rodrigues.
A scholar is included among the top collaborators of Rodrigo Rodrigues 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 Rodrigo Rodrigues. Rodrigo Rodrigues is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Wieder, Alexander, Pramod Bhatotia, Ansley Post, & Rodrigo Rodrigues. (2012). Orchestrating the deployment of computations in the cloud with conductor. Edinburgh Research Explorer (University of Edinburgh). 27–27.63 indexed citations
Bhatotia, Pramod, Rodrigo Rodrigues, & Akshat Verma. (2012). The Proceedings of the 10th USENIX Conference on File and Storage Technologies.11 indexed citations
7.
Bhatotia, Pramod, Alexander Wieder, İstemi Ekin Akkuş, Rodrigo Rodrigues, & Umut A. Acar. (2011). Large-scale incremental data processing with change propagation. IEEE International Conference on Cloud Computing Technology and Science. 2011. 18–18.25 indexed citations
8.
Haeberlen, Andreas, Paarijaat Aditya, Rodrigo Rodrigues, & Peter Druschel. (2010). Accountable virtual machines. Operating Systems Design and Implementation. 119–134.60 indexed citations
9.
Singh, Atul, Pedro Fonseca, Petr Kuznetsov, Rodrigo Rodrigues, & Petros Maniatis. (2009). Zeno: eventually consistent Byzantine-fault tolerance. Max Planck Digital Library. 169–184.46 indexed citations
10.
Haeberlen, Andreas, Rodrigo Rodrigues, Krishna P. Gummadi, & Peter Druschel. (2008). Pretty good packet authentication. Max Planck Digital Library. 10–10.5 indexed citations
Rodrigues, Rodrigo, et al.. (2007). Verme: Worm Containment in Peer-to-Peer Overlays. Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT).6 indexed citations
13.
Rodrigues, Rodrigo, Petr Kouznetsov, & Bobby Bhattacharjee. (2007). Large-scale byzantine fault tolerance: safe but not always live. 17.10 indexed citations
14.
Cowling, James, Daniel S. Myers, Barbara Liskov, Rodrigo Rodrigues, & Liuba Shrira. (2007). HQ Replication: Properties and Optimizations. DSpace@MIT (Massachusetts Institute of Technology).
Gupta, Anjali, Barbara Liskov, & Rodrigo Rodrigues. (2004). Efficient routing for peer-to-peer overlays. Networked Systems Design and Implementation. 9–9.115 indexed citations
18.
Blake, Charles H. & Rodrigo Rodrigues. (2003). High availability, scalable storage, dynamic peer networks: pick two. 1–1.145 indexed citations
19.
Gupta, Anjali, Barbara Liskov, & Rodrigo Rodrigues. (2003). One hop lookups for peer-to-peer overlays. 2–2.77 indexed citations
20.
Rodrigues, Rodrigo & Barbara Liskov. (2003). A Correctness Proof for a Byzantine-Fault-Tolerant Read/Write Atomic Memory with Dynamic Replica Membership. DSpace@MIT (Massachusetts Institute of Technology).1 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.