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 Marc Shapiro'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 Marc Shapiro with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marc Shapiro more than expected).
This network shows the impact of papers produced by Marc Shapiro. 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 Marc Shapiro. The network helps show where Marc Shapiro may publish in the future.
Co-authorship network of co-authors of Marc Shapiro
This figure shows the co-authorship network connecting the top 25 collaborators of Marc Shapiro.
A scholar is included among the top collaborators of Marc Shapiro 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 Marc Shapiro. Marc Shapiro is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Chockler, Gregory, Ýmir Vigfússon, Marcos K. Aguilera, & Marc Shapiro. (2010). Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware.2 indexed citations
Hamadi, Youssef & Marc Shapiro. (2005). PUSHING LOG-BASED RECONCILIATION. International Journal of Artificial Intelligence Tools. 14(3). 445–458.
7.
Shapiro, Marc, et al.. (2004). Brief Announcement: A formalism for consistency and partial replication. HAL (Le Centre pour la Communication Scientifique Directe). 3274.1 indexed citations
Ferreira, Paulo, et al.. (1999). Implementing Garbage Collection in the PerDiS System. HAL (Le Centre pour la Communication Scientifique Directe). 64–77.3 indexed citations
Shapiro, Marc, et al.. (1994). Some Key Issues in the Design of Distributed Garbage Collection and References. HAL (Le Centre pour la Communication Scientifique Directe).4 indexed citations
16.
Shapiro, Marc, et al.. (1994). A Survey of Distributed Garbage Collection Techniques.1 indexed citations
17.
Shapiro, Marc, et al.. (1993). Flexible Bindings for Fine-Grain, Distributed Objects.7 indexed citations
18.
Shapiro, Marc, et al.. (1993). SSP Chains: Robust, Distributed References Supporting Acyclic Garbage Collection. OpenGrey (Institut de l'Information Scientifique et Technique).50 indexed citations
19.
Gourhant, Yvon & Marc Shapiro. (1990). FOG/C++: a Fragmented-Object Generator. HAL (Le Centre pour la Communication Scientifique Directe). 63–74.10 indexed citations
20.
Courtiat, Jean-Pierre, et al.. (1981). Fault Tolerance in Rebus, a Distributed System for Industrial Real Time Control. HAL (Le Centre pour la Communication Scientifique Directe). 224–227.2 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.