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.
A method for obtaining digital signatures and public-key cryptosystems
19837.2k citationsRonald L. Rivest, Adi Shamir et al.Communications of the ACMprofile →
Visual cryptography
19951.2k citationsAdi Shamir et al.Lecture notes in computer scienceprofile →
On the Complexity of Timetable and Multicommodity Flow Problems
1976618 citationsShimon Even, Alon Itai et al.SIAM Journal on Computingprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Adi Shamir'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 Adi Shamir with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Adi Shamir more than expected).
This network shows the impact of papers produced by Adi Shamir. 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 Adi Shamir. The network helps show where Adi Shamir may publish in the future.
Co-authorship network of co-authors of Adi Shamir
This figure shows the co-authorship network connecting the top 25 collaborators of Adi Shamir.
A scholar is included among the top collaborators of Adi Shamir 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 Adi Shamir. Adi Shamir is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Rivest, Ronald L., Adi Shamir, & Leonard M. Adleman. (1983). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM. 26(1). 96–99.7211 indexed citations breakdown →
Rivest, Ronald L., et al.. (1977). On Digital Signatures and Public-Key Cryptosystems.. Defense Technical Information Center (DTIC).106 indexed citations
19.
Rivest, Ronald L., et al.. (1977). A Method for Obtaining Digital Signatures and Public Key Cryptosystems (Formerly on Digital Signatures and Public Key Cryptosystems).5 indexed citations
20.
Even, Shimon, Alon Itai, & Adi Shamir. (1976). On the Complexity of Timetable and Multicommodity Flow Problems. SIAM Journal on Computing. 5(4). 691–703.618 indexed citations breakdown →
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.