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.
Graph structure in the Web
20001.7k citationsAndrei Broder, Ravi Kumar et al.Computer Networksprofile →
Extended static checking for Java
2002829 citationsCormac Flanagan, K. Rustan M. Leino et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Raymie Stata'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 Raymie Stata with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Raymie Stata more than expected).
This network shows the impact of papers produced by Raymie Stata. 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 Raymie Stata. The network helps show where Raymie Stata may publish in the future.
Co-authorship network of co-authors of Raymie Stata
This figure shows the co-authorship network connecting the top 25 collaborators of Raymie Stata.
A scholar is included among the top collaborators of Raymie Stata 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 Raymie Stata. Raymie Stata 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.
Flanagan, Cormac, K. Rustan M. Leino, Mark Lillibridge, et al.. (2013). PLDI 2002. ACM SIGPLAN Notices. 48(4S). 22–33.6 indexed citations
Cooper, Brian F., Rodrigo Fonseca, James J. Kistler, et al.. (2009). Challenges, Techniques and Directions in Building XSeek: an XML Search Engine.. IEEE Data(base) Engineering Bulletin. 32. 36–43.31 indexed citations
Flanagan, Cormac, K. Rustan M. Leino, Mark Lillibridge, et al.. (2002). Extended static checking for Java. ACM SIGPLAN Notices. 37(5). 234–245.60 indexed citations
9.
Flanagan, Cormac, K. Rustan M. Leino, Mark Lillibridge, et al.. (2002). Extended static checking for Java. 234–245.829 indexed citations breakdown →
10.
Leung, Shun-Tak A., et al.. (2001). Towards Web-scale Web Archaeology.3 indexed citations
Broder, Andrei, Ravi Kumar, Farzin Maghoul, et al.. (2000). Graph structure in the Web. Computer Networks. 33(1-6). 309–320.1708 indexed citations breakdown →
13.
Leino, K. Rustan M., James B. Saxe, & Raymie Stata. (1999). Checking Java Programs via Guarded Commands. 110–111.57 indexed citations
14.
Stata, Raymie & Martı́n Abadi. (1999). A type system for Java bytecode subroutines. ACM Transactions on Programming Languages and Systems. 21(1). 90–137.57 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.