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.
Introduction to Software Testing
2008497 citationsPaul Ammann, Jeff Offuttprofile →
MuJava: an automated class mutation system
2004485 citationsYu‐Seung Ma, Jeff Offutt et al.Software Testing Verification and Reliabilityprofile →
Introduction to Software Testing
2016338 citationsPaul Ammann, Jeff Offuttprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Jeff Offutt'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 Jeff Offutt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeff Offutt more than expected).
This network shows the impact of papers produced by Jeff Offutt. 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 Jeff Offutt. The network helps show where Jeff Offutt may publish in the future.
Co-authorship network of co-authors of Jeff Offutt
This figure shows the co-authorship network connecting the top 25 collaborators of Jeff Offutt.
A scholar is included among the top collaborators of Jeff Offutt 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 Jeff Offutt. Jeff Offutt is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hutchison, Amy, et al.. (2021). Designing a Model of Computer Science Professional Development for Elementary Educators in Inclusive Classrooms.. The Journal of Technology and Teacher Education. 29(2). 165–193.1 indexed citations
Deng, Lin, Jeff Offutt, Paul Ammann, & Nariman Mirzaei. (2016). Mutation operators for testing Android apps. Information and Software Technology. 81. 154–168.55 indexed citations
7.
Ammann, Paul, Márcio Eduardo Delamaro, & Jeff Offutt. (2014). Establishing Theoretical Minimal Sets of Mutants. Scientific Electronic Library Online (São Paulo Research Foundation, Latin American and Caribbean Center on Health Sciences Information, Conselho Nacional de Desenvolvimento Científico e Tecnológico). 21–30.126 indexed citations
8.
Delamaro, Márcio Eduardo, Jeff Offutt, & Paul Ammann. (2014). Designing Deletion Mutation Operators. Scientific Electronic Library Online (São Paulo Research Foundation, Latin American and Caribbean Center on Health Sciences Information, Conselho Nacional de Desenvolvimento Científico e Tecnológico). 11–20.40 indexed citations
9.
Kurtz, Bob, Paul Ammann, Márcio Eduardo Delamaro, Jeff Offutt, & Lin Deng. (2014). Mutant Subsumption Graphs. Scientific Electronic Library Online (São Paulo Research Foundation, Latin American and Caribbean Center on Health Sciences Information, Conselho Nacional de Desenvolvimento Científico e Tecnológico). 176–185.61 indexed citations
Grindal, Mats & Jeff Offutt. (2007). Input parameter modeling for combination strategies. International Conference on Software Engineering. 255–260.43 indexed citations
13.
Grindal, Mats, et al.. (2007). Six Issues in Testing Event-Triggered Real-Time Systems. KTH Publication Database DiVA (KTH Royal Institute of Technology).3 indexed citations
14.
Grindal, Mats & Jeff Offutt. (2007). Input Parameter Modeling for Combination Strategies in Software Testing. International Conference on Software Engineering. 255–260.2 indexed citations
15.
Offutt, Jeff, et al.. (2006). Class-component testability analysis. International Conference on Software Engineering. 61–66.3 indexed citations
Ma, Yu‐Seung, Jeff Offutt, & Yong Rae Kwon. (2005). MuJava: an automated class mutation system: Research Articles. Software Testing Verification and Reliability. 15(2). 97–133.40 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.