Dan E. Willard

Publication Activity (10 Years)

Years Active: 1982-2021
Publications (10 Years): 2

Top Topics

Semantic Similarity

Convergence Theorem

Systems Require

Top Venues

J. Log. Comput.

Publications

Dan E. Willard
About the characterization of a fine line that separates generalizations and boundary-case exceptions for the Second Incompleteness Theorem under semantic tableau deduction. J. Log. Comput. 31 (1) (2021)
Dan E. Willard
On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction. LFCS (2020)
Dan E. Willard
On the Broader Epistemological Significance of Self-Justifying Axiom Systems. WoLLIC (2014)
Dan E. Willard
On the Significance of Self-Justifying Axiom Systems from the Perspective of Analytic Tableaux. CoRR (2013)
Dan E. Willard
manage to evade the Herbrandized version of the Second Incompleteness Theorem. Inf. Comput. 207 (10) (2009)
Dan E. Willard
Passive induction and a solution to a Paris-Wilkie open question. Ann. Pure Appl. Log. 146 (2-3) (2007)
Dan E. Willard
On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency. J. Symb. Log. 71 (4) (2006)
Dan E. Willard
Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem. Electron. Notes Theor. Comput. Sci. 165 (2006)
Dan E. Willard
A generalization of the Second Incompleteness Theorem and some exceptions to it. Ann. Pure Appl. Log. 141 (3) (2006)
Dan E. Willard
An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency. J. Symb. Log. 70 (4) (2005)
Dan E. Willard
On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency. TABLEAUX (2005)
Dan E. Willard
How to Extend The Semantic Tableaux and Cut-Free Versions of The Second Incompleteness Theorem Almost to Robinson's Arithmetic Q. J. Symb. Log. 67 (1) (2002)
Dan E. Willard
Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem. TABLEAUX (2002)
Dan E. Willard
An Algorithm for Handling Many Relational Calculus Queries Efficiently. J. Comput. Syst. Sci. 65 (2) (2002)
Dan E. Willard
Self-Verifying Axiom Systems, The Incompleteness Theorem and Related Reflection Principles. J. Symb. Log. 66 (2) (2001)
Dan E. Willard
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree. SIAM J. Comput. 29 (3) (2000)
Dan E. Willard
The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q. TABLEAUX (2000)
Dan E. Willard
The Tangibility Reflection Principle for Self-Verifying Axiom Systems. Kurt Gödel Colloquium (1997)
Dan E. Willard
Self-reflection principles and NP-hardness. Proof Complexity and Feasible Arithmetics (1996)
Dan E. Willard
Applications of Range Query Theory to Relational Data Base Join and Selection Operations. J. Comput. Syst. Sci. 52 (1) (1996)
Michael L. Fredman, Dan E. Willard
Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comput. Syst. Sci. 48 (3) (1994)
Michael L. Fredman, Dan E. Willard
Surpassing the Information Theoretic Bound with Fusion Trees. J. Comput. Syst. Sci. 47 (3) (1993)
Dan E. Willard
Self-Verifying Axiom Systems. Kurt Gödel Colloquium (1993)
Dan E. Willard
Applications of the Fusion Tree Method to Computational Geometry and Searching. SODA (1992)
Dan E. Willard
A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time Inf. Comput. 97 (2) (1992)
Dan E. Willard
Optimal Sample Cost Residues for Differential Database Batch Query Problems. J. ACM 38 (1) (1991)
Dan E. Willard
Quasilinear Algorithms for Processing Relational Calculus Expressions. PODS (1990)
Michael L. Fredman, Dan E. Willard
Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths FOCS (1990)
Young C. Wee, Seth Chaiken, Dan E. Willard
On the Angle Restricted Nearest Neighbor Problem. Inf. Process. Lett. 34 (2) (1990)
Young C. Wee, Seth Chaiken, Dan E. Willard
Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version). ACM Conference on Computer Science (1990)
Michael L. Fredman, Dan E. Willard
BLASTING through the Information Theoretic Barrier with FUSION TREES STOC (1990)
Dan E. Willard, John H. Reif
Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search Inf. Comput. 81 (3) (1989)
Dan E. Willard
Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems Inf. Comput. 82 (1) (1989)
Dan E. Willard, Young C. Wee
Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. SCG (1988)
Dan E. Willard
Multidimensional search trees that provide new types of memory reductions. J. ACM 34 (4) (1987)
Dan E. Willard
Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract). ICALP (1986)
Dan E. Willard
Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel. SIAM J. Comput. 15 (2) (1986)
Dan E. Willard
On the Application of Shared Retrieval to Orthogonal Range Queries. SCG (1986)
Dan E. Willard
Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files. SIGMOD Conference (1986)
Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard
Algorithms for Resolving Conflicts in Dynamic Storage Allocation J. ACM 32 (2) (1985)
Dan E. Willard
New Data Structures for Orthogonal Range Queries. SIAM J. Comput. 14 (1) (1985)
Dan E. Willard, George S. Lueker
Adding Range Restriction Capability to Dynamic Data Structures J. ACM 32 (3) (1985)
Dan E. Willard
Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract). STACS (1985)
Dan E. Willard
Searching Unindexed and Nonuniformly Generated Files in log log N Time. SIAM J. Comput. 14 (4) (1985)
Dan E. Willard
New Trie Data Structures Which Support Very Fast Search Operations. J. Comput. Syst. Sci. 28 (3) (1984)
Dan E. Willard
Efficient Processing of Relational Calculus Expressions Using Range Query Theory. SIGMOD Conference (1984)
Dan E. Willard
Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report) STOC (1984)
Dan E. Willard
Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract). ICALP (1984)
Dan E. Willard
Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). Inf. Process. Lett. 17 (2) (1983)
George S. Lueker, Dan E. Willard
A Data Structure for Dynamic Range Queries. Inf. Process. Lett. 15 (5) (1982)
Dan E. Willard
Polygon Retrieval. SIAM J. Comput. 11 (1) (1982)
Dan E. Willard
Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract) STOC (1982)