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.
Time, clocks, and the ordering of events in a distributed system
19785.2k citationsLeslie LamportCommunications of the ACMprofile →
The Byzantine Generals Problem
19823.3k citationsLeslie Lamport, Robert E. Shostak et al.profile →
Password authentication with insecure communication
19811.8k citationsLeslie LamportCommunications of the ACMprofile →
The part-time parliament
19981.6k citationsLeslie LamportACM Transactions on Computer Systemsprofile →
Countries citing papers authored by Leslie Lamport
Since
Specialization
Citations
This map shows the geographic impact of Leslie Lamport'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 Leslie Lamport with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leslie Lamport more than expected).
This network shows the impact of papers produced by Leslie Lamport. 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 Leslie Lamport. The network helps show where Leslie Lamport may publish in the future.
Co-authorship network of co-authors of Leslie Lamport
This figure shows the co-authorship network connecting the top 25 collaborators of Leslie Lamport.
A scholar is included among the top collaborators of Leslie Lamport 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 Leslie Lamport. Leslie Lamport 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
#
Work
Indexed citations
1
If You’re Not Writing a Program, Don’t Use a Programming Language
2018·Bulletin of the European Association for Theoretical Computer Science·Leslie Lamport
1
2
A Lattice-Structured Proof of a Minimum Spanning Tree Algorithm
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.