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.
Implementation techniques for main memory database systems
1984588 citationsDavid J. DeWitt, Randy H. Katz et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Leonard Shapiro
Since
Specialization
Citations
This map shows the geographic impact of Leonard 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 Leonard Shapiro with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leonard Shapiro more than expected).
This network shows the impact of papers produced by Leonard 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 Leonard Shapiro. The network helps show where Leonard Shapiro may publish in the future.
Co-authorship network of co-authors of Leonard Shapiro
This figure shows the co-authorship network connecting the top 25 collaborators of Leonard Shapiro.
A scholar is included among the top collaborators of Leonard 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 Leonard Shapiro. Leonard Shapiro is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
DeWitt, David J., Randy H. Katz, Frank Olken, et al.. (1984). Implementation techniques for main memory database systems. 1–1.588 indexed citations breakdown →
12.
Ioannidis, Yannis, et al.. (1984). Heuristic Search in Data Base Systems.. 537–548.43 indexed citations
13.
Richter, Marcel K. & Leonard Shapiro. (1978). Revelations of a gambler. Journal of Mathematical Economics. 5(3). 229–244.4 indexed citations
14.
Shapiro, Leonard. (1977). NECESSARY AND SUFFICIENT CONDITIONS FOR EXPECTED UTILITY MAXIMIZATION: THE FINITE CASE, WITH A PARTIAL ORDER. University of Minnesota Digital Conservancy (University of Minnesota).4 indexed citations
15.
Ellis, Robert, Shmuel Glasner, & Leonard Shapiro. (1975). Proximal-isometric (P J) flows. Advances in Mathematics. 17(3). 213–260.37 indexed citations
16.
Petersen, Karl & Leonard Shapiro. (1973). Induced flows. Transactions of the American Mathematical Society. 177(0). 375–390.17 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.