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.
Countries citing papers authored by J. David Schaffer
Since
Specialization
Citations
This map shows the geographic impact of J. David Schaffer'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. David Schaffer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. David Schaffer more than expected).
Fields of papers citing papers by J. David Schaffer
This network shows the impact of papers produced by J. David Schaffer. 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. David Schaffer. The network helps show where J. David Schaffer may publish in the future.
Co-authorship network of co-authors of J. David Schaffer
This figure shows the co-authorship network connecting the top 25 collaborators of J. David Schaffer.
A scholar is included among the top collaborators of J. David Schaffer 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. David Schaffer. J. David Schaffer is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Schaffer, J. David, et al.. (2002). Improving Digital Video Commercial Detectors With Genetic Algorithms. Genetic and Evolutionary Computation Conference. 1212–1218.1 indexed citations
6.
Mathias, Keith E., et al.. (2000). Code compaction using genetic algorithms. Genetic and Evolutionary Computation Conference. 710–717.5 indexed citations
7.
Eshelman, Larry J., Keith E. Mathias, & J. David Schaffer. (1997). Crossover Operator Biases: Exploiting the Population Distribution.. international conference on Genetic algorithms. 354–361.53 indexed citations
8.
Eshelman, Larry J. & J. David Schaffer. (1993). Crossover's Niche. international conference on Genetic algorithms. 9–14.65 indexed citations
9.
Schaffer, J. David & Larry J. Eshelman. (1993). Designing Multiplierless Digital Filters Using Genetic Algorithms. international conference on Genetic algorithms. 439–444.17 indexed citations
10.
Whitley, L. Darrell & J. David Schaffer. (1992). COGANN-92 : International Workshop on Combinations of Genetic Algorithms and Neural Networks, June 6, 1992 Baltimore, Maryland. IEEE Computer Society Press eBooks.2 indexed citations
11.
Schaffer, J. David, Richard A. Caruana, & Larry J. Eshelman. (1991). Using genetic search to exploit the emergent behavior of neural networks. MIT Press eBooks. 244–248.5 indexed citations
12.
Schaffer, J. David & Larry J. Eshelman. (1991). On Crossover as an Evolutionarily Viable Strategy.. 61–68.49 indexed citations
Eshelman, Larry J., Richard A. Caruana, & J. David Schaffer. (1989). Biases in the crossover landscape. international conference on Genetic algorithms. 10–19.222 indexed citations
Schaffer, J. David & John J. Grefenstette. (1985). Multi-objective learning via genetic algorithms. International Joint Conference on Artificial Intelligence. 593–595.56 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.