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.
Parallel Processing with the Perfect Shuffle
1971933 citationsHarold S. StoneIEEE Transactions on Computersprofile →
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
1973876 citationsPeter M. Kogge, Harold S. StoneIEEE Transactions on Computersprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Harold S. Stone
Since
Specialization
Citations
This map shows the geographic impact of Harold S. Stone'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 Harold S. Stone with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Harold S. Stone more than expected).
This network shows the impact of papers produced by Harold S. Stone. 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 Harold S. Stone. The network helps show where Harold S. Stone may publish in the future.
Co-authorship network of co-authors of Harold S. Stone
This figure shows the co-authorship network connecting the top 25 collaborators of Harold S. Stone.
A scholar is included among the top collaborators of Harold S. Stone 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 Harold S. Stone. Harold S. Stone is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Miller, Madison, Harold S. Stone, & Ingemar J. Cox. (1997). Optimizing Murty's ranked assignment method. IEEE Transactions on Aerospace and Electronic Systems. 33(3). 851–862.109 indexed citations
4.
Li, Chung‐Sheng & Harold S. Stone. (1993). Differential Board/Backplane Optical Interconnects for High-speed Digital Systems Part I: Theory. Journal of Lightwave Technology. 11(7). 1234–1249.12 indexed citations
Kogge, Peter M. & Harold S. Stone. (1973). A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations. IEEE Transactions on Computers. C-22(8). 786–793.876 indexed citations breakdown →
17.
Stone, Harold S.. (1971). Introduction to Computer Organization and Data Structures. CERN Document Server (European Organization for Nuclear Research).40 indexed citations
18.
Stone, Harold S. & Daniel P. Siewiorek. (1971). Introduction to computer organization and data structures, PDP-11 edition. Medical Entomology and Zoology.3 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.