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.
The Byzantine Generals Problem
19823.3k citationsLeslie Lamport, Robert E. Shostak et al.ACM Transactions on Programming Languages and Systemsprofile →
Reaching Agreement in the Presence of Faults
19801.2k citationsMarshall C. Pease, Robert E. Shostak et al.Journal of the ACMprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Robert E. Shostak
Since
Specialization
Citations
This map shows the geographic impact of Robert E. Shostak'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 Robert E. Shostak with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert E. Shostak more than expected).
Fields of papers citing papers by Robert E. Shostak
This network shows the impact of papers produced by Robert E. Shostak. 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 Robert E. Shostak. The network helps show where Robert E. Shostak may publish in the future.
Co-authorship network of co-authors of Robert E. Shostak
This figure shows the co-authorship network connecting the top 25 collaborators of Robert E. Shostak.
A scholar is included among the top collaborators of Robert E. Shostak 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 Robert E. Shostak. Robert E. Shostak 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.
Dolev, Danny, Leslie Lamport, Marshall C. Pease, & Robert E. Shostak. (1987). The Byzantine generals. 17(6). 348–369.12 indexed citations
2.
Shostak, Robert E.. (1984). Proceedings of the 7th International Conference on Automated Deduction.6 indexed citations
Levitt, Karl, et al.. (1983). Investigation, Development, and Evaluation of Performance Proving for Fault-tolerant Computers. NASA Technical Reports Server (NASA).2 indexed citations
6.
Shostak, Robert E.. (1983). Computer-Assisted Composition Instruction: Some Promising Practices.. 8(1). 4–6.2 indexed citations
7.
Lamport, Leslie, Robert E. Shostak, & Marshall C. Pease. (1982). The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems. 4(3). 382–401.3348 indexed citations breakdown →
8.
Wensley, J. H., et al.. (1982). Design study of Software-Implemented Fault-Tolerance (SIFT) computer. NASA STI Repository (National Aeronautics and Space Administration).1 indexed citations
Pease, Marshall C., Robert E. Shostak, & Leslie Lamport. (1980). Reaching Agreement in the Presence of Faults. Journal of the ACM. 27(2). 228–234.1236 indexed citations breakdown →
11.
Bledsoe, W. W., et al.. (1979). A prover for general inequalities. International Joint Conference on Artificial Intelligence. 66–69.3 indexed citations
Wensley, J. H., Leslie Lamport, Jack Goldberg, et al.. (1978). SIFT - Design and analysis of a fault-tolerant computer for aircraft control. [Software Implemented Fault Tolerant systems]. NASA Technical Reports Server (NASA).4 indexed citations
Shostak, Robert E.. (1976). Refutation graphs. Artificial Intelligence. 7(1). 51–64.50 indexed citations
20.
Baker, Brenda S. & Robert E. Shostak. (1972). Gossips and telephones. Discrete Mathematics. 2(3). 191–193.82 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.