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.
Impossibility of distributed consensus with one faulty process
19852.4k citationsMichael J. Fischer, Nancy Lynch et al.profile →
This map shows the geographic impact of Nancy Lynch'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 Nancy Lynch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nancy Lynch more than expected).
This network shows the impact of papers produced by Nancy Lynch. 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 Nancy Lynch. The network helps show where Nancy Lynch may publish in the future.
Co-authorship network of co-authors of Nancy Lynch
This figure shows the co-authorship network connecting the top 25 collaborators of Nancy Lynch.
A scholar is included among the top collaborators of Nancy Lynch 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 Nancy Lynch. Nancy Lynch is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Konwar, Kishori M., N. Prakash, Nancy Lynch, & Muriel Médard. (2017). RADON: Repairable Atomic Data Object in Networks. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 70. 17.2 indexed citations
6.
Welch, Jennifer L., Leslie Lamport, & Nancy Lynch. (2016). A Lattice-Structured Proof of a Minimum Spanning Tree Algorithm.
Canetti, Ran, Ling Cheung, Nancy Lynch, & Olivier Pereira. (2007). On the Role of Scheduling in Simulation-Based Security. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 2007. 102.5 indexed citations
10.
Canetti, Ran, Ling Cheung, Dilsun Kaynar, et al.. (2005). Using Probabilistic I/O Automata to improve the analysis of cryptographic protocols. DIAL (Catholic University of Leuven). 63. 40–41.1 indexed citations
11.
Mitra, Sayan, Wang Yong, Nancy Lynch, & Éric Féron. (2003). Safety verification of model helicopter controller using hybrid input/output automata. Lecture notes in computer science. 2623. 343–358.8 indexed citations
12.
Garland, Stephen J. & Nancy Lynch. (2000). Using I/O automata for developing distributed systems. Cambridge University Press eBooks. 285–312.39 indexed citations
13.
Bar‐Joseph, Ziv, Idit Keidar, Tal Anker, & Nancy Lynch. (2000). Totally Ordered Multicast with Bounded Delays and Variable Rates.. 143–162.2 indexed citations
14.
Luchangco, Victor, et al.. (1994). Verifying timing properties of concurrent algorithms.. 259–273.5 indexed citations
15.
Lynch, Nancy, Michael Merritt, & Ronald R. Yager. (1993). Atomic Transactions: In Concurrent and Distributed Systems. Morgan Kaufmann Publishers Inc. eBooks.11 indexed citations
16.
Lampson, Butler, et al.. (1993). Correctness of At-Most-Once Message Delivery Protocols. 385–400.13 indexed citations
17.
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
18.
Fekete, Alan, Nancy Lynch, & Liuba Shrira. (1987). A Modular Proof of Correctness for a Network Synchronizer (Research Summary). 219–256.4 indexed citations
Johnson, David S., Michael L. Fredman, Richard M. Karp, et al.. (1983). Proceedings of the fifteenth annual ACM symposium on Theory of computing.39 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.