Predicate-Oriented Database Search Algorithms - Dan E. Willard (Garland Publishing, New York, 1978)

Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract) - Dan E. Willard (STOC, 1982)

A Data Structure for Dynamic Range Queries. - George S. Lueker; Dan E. Willard (Inf. Process. Lett., 1982)

Polygon Retrieval. - Dan E. Willard (SIAM J. Comput., 1982)

Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). - Dan E. Willard (Inf. Process. Lett., 1983)

Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract). - Dan E. Willard (ICALP, 1984)

Efficient Processing of Relational Calculus Expressions Using Range Query Theory. - Dan E. Willard (SIGMOD Conference, 1984)

Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report) - Dan E. Willard (STOC, 1984)

New Trie Data Structures Which Support Very Fast Search Operations. - Dan E. Willard (J. Comput. Syst. Sci., 1984)

Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract). - Dan E. Willard (STACS, 1985)

New Data Structures for Orthogonal Range Queries. - Dan E. Willard (SIAM J. Comput., 1985)

Searching Unindexed and Nonuniformly Generated Files in log log N Time. - Dan E. Willard (SIAM J. Comput., 1985)

Algorithms for Resolving Conflicts in Dynamic Storage Allocation - Brenda S. Baker; Edward G. Coffman Jr.; Dan E. Willard (J. ACM, 1985)

Adding Range Restriction Capability to Dynamic Data Structures - Dan E. Willard; George S. Lueker (J. ACM, 1985)

On the Application of Shared Retrieval to Orthogonal Range Queries. - Dan E. Willard (SCG, 1986)

Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract). - Dan E. Willard (ICALP, 1986)

Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files. - Dan E. Willard (SIGMOD Conference, 1986)

Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel. - Dan E. Willard (SIAM J. Comput., 1986)

Multidimensional search trees that provide new types of memory reductions. - Dan E. Willard (J. ACM, 1987)

Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. - Dan E. Willard; Young C. Wee (SCG, 1988)

Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search - Dan E. Willard; John H. Reif (Inf. Comput., 1989)

Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems - Dan E. Willard (Inf. Comput., 1989)

Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version). - Young C. Wee; Seth Chaiken; Dan E. Willard (ACM Conference on Computer Science, 1990)

Quasilinear Algorithms for Processing Relational Calculus Expressions. - Dan E. Willard (PODS, 1990)

BLASTING through the Information Theoretic Barrier with FUSION TREES - Michael L. Fredman; Dan E. Willard (STOC, 1990)

On the Angle Restricted Nearest Neighbor Problem. - Young C. Wee; Seth Chaiken; Dan E. Willard (Inf. Process. Lett., 1990)

Optimal Sample Cost Residues for Differential Database Batch Query Problems. - Dan E. Willard (J. ACM, 1991)

Applications of the Fusion Tree Method to Computational Geometry and Searching. - Dan E. Willard (SODA, 1992)

A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time - Dan E. Willard (Inf. Comput., 1992)

Self-Verifying Axiom Systems. - Dan E. Willard (Kurt Gödel Colloquium, 1993)

Surpassing the Information Theoretic Bound with Fusion Trees. - Michael L. Fredman; Dan E. Willard (J. Comput. Syst. Sci., 1993)

Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. - Michael L. Fredman; Dan E. Willard (J. Comput. Syst. Sci., 1994)

Self-reflection principles and NP-hardness. - Dan E. Willard (Proof Complexity and Feasible Arithmetics, 1996)

Applications of Range Query Theory to Relational Data Base Join and Selection Operations. - Dan E. Willard (J. Comput. Syst. Sci., 1996)

The Tangibility Reflection Principle for Self-Verifying Axiom Systems. - Dan E. Willard (Kurt Gödel Colloquium, 1997)

The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q. - Dan E. Willard (TABLEAUX, 2000)

Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree. - Dan E. Willard (SIAM J. Comput., 2000)

Self-Verifying Axiom Systems, The Incompleteness Theorem and Related Reflection Principles. - Dan E. Willard (J. Symb. Log., 2001)

Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem. - Dan E. Willard (TABLEAUX, 2002)

An Algorithm for Handling Many Relational Calculus Queries Efficiently. - Dan E. Willard (J. Comput. Syst. Sci., 2002)

How to Extend The Semantic Tableaux and Cut-Free Versions of The Second Incompleteness Theorem Almost to Robinson's Arithmetic Q. - Dan E. Willard (J. Symb. Log., 2002)

On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency. - Dan E. Willard (TABLEAUX, 2005)

An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency. - Dan E. Willard (J. Symb. Log., 2005)

A generalization of the Second Incompleteness Theorem and some exceptions to it. - Dan E. Willard (Ann. Pure Appl. Log., 2006)

The Axiom System ISigma0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem. - Dan E. Willard (WoLLIC, 2006)

On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency. - Dan E. Willard (J. Symb. Log., 2006)

Passive induction and a solution to a Paris-Wilkie open question. - Dan E. Willard (Ann. Pure Appl. Log., 2007)

Some specially formulated axiomizations for ISigma0 manage to evade the Herbrandized version of the Second Incompleteness Theorem. - Dan E. Willard (Inf. Comput., 2009)

On the Significance of Self-Justifying Axiom Systems from the Perspective of Analytic Tableaux. - Dan E. Willard (CoRR, 2013)

On the Broader Epistemological Significance of Self-Justifying Axiom Systems. - Dan E. Willard (WoLLIC, 2014)

On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction. - Dan E. Willard (LFCS, 2020)

About the characterization of a fine line that separates generalizations and boundary-case exceptions for the Second Incompleteness Theorem under semantic tableau deduction. - Dan E. Willard (J. Log. Comput., 2021)