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 fast string searching algorithm
19771.4k citationsRobert S. Boyer, J Strother Mooreprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by J Strother Moore
Since
Specialization
Citations
This map shows the geographic impact of J Strother Moore'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 J Strother Moore with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J Strother Moore more than expected).
Fields of papers citing papers by J Strother Moore
This network shows the impact of papers produced by J Strother Moore. 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 J Strother Moore. The network helps show where J Strother Moore may publish in the future.
Co-authorship network of co-authors of J Strother Moore
This figure shows the co-authorship network connecting the top 25 collaborators of J Strother Moore.
A scholar is included among the top collaborators of J Strother Moore 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 J Strother Moore. J Strother Moore 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.
Hunt, Warren A., et al.. (2022). VWSIM: A Circuit Simulator. Electronic Proceedings in Theoretical Computer Science. 359. 61–75.1 indexed citations
Moore, J Strother, et al.. (1998). A Mechanically Checked Proof of the.
10.
Moore, J Strother, et al.. (1997). The Particle Beam Optics Interactive Computer Laboratory for Personal Computers and Workstations. APS.1 indexed citations
11.
Boyer, Robert S. & J Strother Moore. (1997). Mechanized formal reasoning about programs and computing machines. MIT Press eBooks. 147–176.13 indexed citations
Moore, J Strother, et al.. (1988). Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic. 83–124.60 indexed citations
14.
Boyer, Robert S. & J Strother Moore. (1985). Program verification. Defense Technical Information Center (DTIC). 1(1). 17.14 indexed citations
Moore, J Strother, et al.. (1980). A Verification Condition Generator for FORTRAN.. Defense Technical Information Center (DTIC).6 indexed citations
17.
Moore, J Strother, et al.. (1979). A Theorem-Prover for Recursive Functions: A User's Manual.. Defense Technical Information Center (DTIC).1 indexed citations
18.
Boyer, Robert S. & J Strother Moore. (1977). A lemma driven automatic theorem prover for recursive function theory. Defense Technical Information Center (DTIC). 511–519.24 indexed citations
19.
Moore, J Strother, et al.. (1977). A computer Proof of the Correctness of a Simple Optimizing Compiler for Expressions.. Defense Technical Information Center (DTIC).2 indexed citations
20.
Moore, J Strother. (1976). The INTERLISP Virtual Machine Specification,. Defense Technical Information Center (DTIC).6 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.