Dan E. Willard

6.7k total citations · 1 hit paper
51 papers, 4.4k citations indexed

About

Dan E. Willard is a scholar working on Artificial Intelligence, Signal Processing and Computer Networks and Communications. According to data from OpenAlex, Dan E. Willard has authored 51 papers receiving a total of 4.4k indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Artificial Intelligence, 23 papers in Signal Processing and 21 papers in Computer Networks and Communications. Recurrent topics in Dan E. Willard's work include Data Management and Algorithms (23 papers), Algorithms and Data Compression (20 papers) and Computational Geometry and Mesh Generation (12 papers). Dan E. Willard is often cited by papers focused on Data Management and Algorithms (23 papers), Algorithms and Data Compression (20 papers) and Computational Geometry and Mesh Generation (12 papers). Dan E. Willard collaborates with scholars based in United States and Netherlands. Dan E. Willard's co-authors include Robert Trivers, Michael L. Fredman, George S. Lueker, Brenda S. Baker, Douglas F. Stotz, Scott M. Lanyon, John H. Reif and Seth Chaiken and has published in prestigious journals such as Science, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Dan E. Willard

50 papers receiving 3.9k citations

Hit Papers

Natural Selection of Parental Ability to Vary the Sex Rat... 1973 2026 1990 2008 1973 500 1000 1.5k 2.0k 2.5k
What are hit papers?

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.

  1. Natural Selection of Parental Ability to Vary the Sex Ratio of Offspring
    1973 2.9k citations Dan E. Willard et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Dan E. Willard United States 17 1.2k 1.1k 1.0k 752 608 51 4.4k
Byron J. T. Morgan United Kingdom 40 32 0.0× 3.5k 3.1× 826 0.8× 514 0.7× 132 0.2× 194 7.0k
James E. Mosimann United States 24 127 0.1× 732 0.6× 456 0.4× 502 0.7× 13 0.0× 49 4.0k
John F. Bell United Kingdom 20 64 0.1× 3.2k 2.8× 1.0k 1.0× 128 0.2× 34 0.1× 68 6.9k
Michael Bulmer United Kingdom 42 115 0.1× 1.2k 1.0× 1.9k 1.8× 108 0.1× 25 0.0× 109 6.9k
Eugene S. Edgington Canada 19 28 0.0× 231 0.2× 146 0.1× 228 0.3× 59 0.1× 65 3.2k
Jason Jones United States 29 69 0.1× 1.9k 1.7× 567 0.5× 326 0.4× 106 0.2× 85 4.9k
John J. McDermott United States 33 10 0.0× 1.6k 1.4× 782 0.7× 277 0.4× 101 0.2× 138 6.3k
Marc Mangel United States 47 22 0.0× 3.0k 2.6× 2.7k 2.6× 65 0.1× 53 0.1× 164 8.4k
Cedric A. B. Smith United Kingdom 32 29 0.0× 351 0.3× 455 0.4× 398 0.5× 25 0.0× 110 4.3k
Stephen Wooding United States 29 30 0.0× 380 0.3× 401 0.4× 216 0.3× 20 0.0× 50 5.5k

Countries citing papers authored by Dan E. Willard

Since Specialization
Citations

This map shows the geographic impact of Dan E. Willard'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 Dan E. Willard with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dan E. Willard more than expected).

Fields of papers citing papers by Dan E. Willard

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dan E. Willard. 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 Dan E. Willard. The network helps show where Dan E. Willard may publish in the future.

Co-authorship network of co-authors of Dan E. Willard

This figure shows the co-authorship network connecting the top 25 collaborators of Dan E. Willard. A scholar is included among the top collaborators of Dan E. Willard 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 Dan E. Willard. Dan E. Willard 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.
Willard, Dan E.. (2009). Some specially formulated axiomizations for IΣ0manage to evade the Herbrandized version of the Second Incompleteness Theorem. Information and Computation. 207(10). 1078–1093. 1 indexed citations
2.
Willard, Dan E.. (2007). Passive induction and a solution to a Paris–Wilkie open question. Annals of Pure and Applied Logic. 146(2-3). 124–149. 5 indexed citations
3.
Willard, Dan E.. (2006). A generalization of the Second Incompleteness Theorem and some exceptions to it. Annals of Pure and Applied Logic. 141(3). 472–496. 9 indexed citations
4.
Willard, Dan E.. (2002). An Algorithm for Handling Many Relational Calculus Queries Efficiently. Journal of Computer and System Sciences. 65(2). 295–331. 13 indexed citations
5.
Willard, Dan E.. (2001). Self-verifying axiom systems, the incompleteness theorem and related reflection principles. Journal of Symbolic Logic. 66(2). 536–596. 14 indexed citations
6.
Willard, Dan E.. (2000). Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree. SIAM Journal on Computing. 29(3). 1030–1049. 30 indexed citations
7.
Willard, Dan E.. (1996). Applications of Range Query Theory to Relational Data Base Join and Selection Operations. Journal of Computer and System Sciences. 52(1). 157–169. 11 indexed citations
8.
Fredman, Michael L. & Dan E. Willard. (1994). Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences. 48(3). 533–551. 194 indexed citations
9.
Fredman, Michael L. & Dan E. Willard. (1993). Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences. 47(3). 424–436. 197 indexed citations
10.
Willard, Dan E.. (1992). Applications of the fusion tree method to computational geometry and searching. Symposium on Discrete Algorithms. 286–295. 14 indexed citations
11.
Willard, Dan E.. (1990). Quasilinear Algorithms for Processing Relational Calculus Expressions.. 243–257. 2 indexed citations
12.
Willard, Dan E.. (1986). Lower bounds for dynamic range query problems that permit subtraction. International Colloquium on Automata, Languages and Programming. 444–453. 3 indexed citations
13.
Willard, Dan E.. (1985). Reduced memory space for multi-dimensional search trees. 363–374. 8 indexed citations
14.
Willard, Dan E.. (1985). Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time. SIAM Journal on Computing. 14(4). 1013–1029. 16 indexed citations
15.
Willard, Dan E.. (1984). New trie data structures which support very fast search operations. Journal of Computer and System Sciences. 28(3). 379–394. 57 indexed citations
16.
Willard, Dan E.. (1983). Log-logarithmic worst-case range queries are possible in space Θ(N). Information Processing Letters. 17(2). 81–84. 143 indexed citations
17.
Lueker, George S. & Dan E. Willard. (1982). A data structure for dynamic range queries. Information Processing Letters. 15(5). 209–213. 26 indexed citations
18.
Willard, Dan E.. (1979). New Data Structures for Orthogonal Queries.. Defense Technical Information Center (DTIC). 9 indexed citations
19.
Willard, Dan E.. (1978). Predicate-oriented database search algorithms. Defense Technical Information Center (DTIC). 34 indexed citations
20.
Willard, Dan E.. (1978). Balanced Forests of K-D* Trees as a Dynamic Data Structure.. 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Byron J. T. Morgan Breakdown of academic impact, for papers by James E. Mosimann Breakdown of academic impact, for papers by John F. Bell Breakdown of academic impact, for papers by Michael Bulmer Breakdown of academic impact, for papers by Eugene S. Edgington Breakdown of academic impact, for papers by Jason Jones Breakdown of academic impact, for papers by John J. McDermott Breakdown of academic impact, for papers by Marc Mangel Breakdown of academic impact, for papers by Cedric A. B. Smith Breakdown of academic impact, for papers by Stephen Wooding
Rankless by CCL
2026