Dan E. Willard

Affiliations:

University at Albany, SUNY, USA

According to our database¹, Dan E. Willard authored at least 52 papers between 1978 and 2021.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2021

About the characterization of a fine line that separates generalizations and boundary-case exceptions for the Second Incompleteness Theorem under semantic tableau deduction.

[BibT_eX]

[DOI]

Dan E. Willard

J. Log. Comput., 2021

2020

On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

2014

On the Broader Epistemological Significance of Self-Justifying Axiom Systems.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Logic, Language, Information, and Computation, 2014

2013

On the Significance of Self-Justifying Axiom Systems from the Perspective of Analytic Tableaux.

[BibT_eX]

[DOI]

Dan E. Willard

CoRR, 2013

2009

Some specially formulated axiomizations for ISigma<sub>0</sub> manage to evade the Herbrandized version of the Second Incompleteness Theorem.

[BibT_eX]

[DOI]

Dan E. Willard

Inf. Comput., 2009

2007

Passive induction and a solution to a Paris-Wilkie open question.

[BibT_eX]

[DOI]

Dan E. Willard

Ann. Pure Appl. Log., 2007

2006

On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency.

[BibT_eX]

[DOI]

Dan E. Willard

J. Symb. Log., 2006

The Axiom System ISigma<sub>0</sub> Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006

A generalization of the Second Incompleteness Theorem and some exceptions to it.

[BibT_eX]

[DOI]

Dan E. Willard

Ann. Pure Appl. Log., 2006

2005

An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency.

[BibT_eX]

[DOI]

Dan E. Willard

J. Symb. Log., 2005

On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2005

2002

How to Extend The Semantic Tableaux and Cut-Free Versions of The Second Incompleteness Theorem Almost to Robinson's Arithmetic Q.

[BibT_eX]

[DOI]

Dan E. Willard

J. Symb. Log., 2002

An Algorithm for Handling Many Relational Calculus Queries Efficiently.

[BibT_eX]

[DOI]

Dan E. Willard

J. Comput. Syst. Sci., 2002

Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

2001

Self-Verifying Axiom Systems, The Incompleteness Theorem and Related Reflection Principles.

[BibT_eX]

[DOI]

Dan E. Willard

J. Symb. Log., 2001

2000

Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree.

[BibT_eX]

[DOI]

Dan E. Willard

SIAM J. Comput., 2000

The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

1997

The Tangibility Reflection Principle for Self-Verifying Axiom Systems.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

1996

Applications of Range Query Theory to Relational Data Base Join and Selection Operations.

[BibT_eX]

[DOI]

Dan E. Willard

J. Comput. Syst. Sci., 1996

Self-reflection principles and NP-hardness.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Proof Complexity and Feasible Arithmetics, 1996

1994

Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths.

[BibT_eX]

[DOI]

Michael L. Fredman

Dan E. Willard

J. Comput. Syst. Sci., 1994

1993

Surpassing the Information Theoretic Bound with Fusion Trees.

[BibT_eX]

[DOI]

Michael L. Fredman

Dan E. Willard

J. Comput. Syst. Sci., 1993

Self-Verifying Axiom Systems.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992

A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time

[BibT_eX]

[DOI]

Dan E. Willard

Inf. Comput., April, 1992

Applications of the Fusion Tree Method to Computational Geometry and Searching.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991

Optimal Sample Cost Residues for Differential Database Batch Query Problems.

[BibT_eX]

[DOI]

Dan E. Willard

J. ACM, 1991

1990

On the Angle Restricted Nearest Neighbor Problem.

[BibT_eX]

[DOI]

Young C. Wee

Seth Chaiken

Dan E. Willard

Inf. Process. Lett., 1990

BLASTING through the Information Theoretic Barrier with FUSION TREES

[BibT_eX]

[DOI]

Michael L. Fredman

Dan E. Willard

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Quasilinear Algorithms for Processing Relational Calculus Expressions.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990

Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version).

[BibT_eX]

[DOI]

Young C. Wee

Seth Chaiken

Dan E. Willard

Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990

1989

Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems

[BibT_eX]

[DOI]

Dan E. Willard

Inf. Comput., July, 1989

Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search

[BibT_eX]

[DOI]

Dan E. Willard

John H. Reif

Inf. Comput., June, 1989

1988

Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems.

[BibT_eX]

[DOI]

Dan E. Willard

Young C. Wee

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Multidimensional search trees that provide new types of memory reductions.

[BibT_eX]

[DOI]

Dan E. Willard

J. ACM, 1987

1986

Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel.

[BibT_eX]

[DOI]

Dan E. Willard

SIAM J. Comput., 1986

Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the 1986 ACM SIGMOD International Conference on Management of Data, 1986

Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract).

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

On the Application of Shared Retrieval to Orthogonal Range Queries.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Adding Range Restriction Capability to Dynamic Data Structures

[BibT_eX]

[DOI]

Dan E. Willard

George S. Lueker

J. ACM, July, 1985

Algorithms for Resolving Conflicts in Dynamic Storage Allocation

[BibT_eX]

[DOI]

Brenda S. Baker

Edward G. Coffman Jr.

Dan E. Willard

J. ACM, April, 1985

Searching Unindexed and Nonuniformly Generated Files in log log N Time.

[BibT_eX]

[DOI]

Dan E. Willard

SIAM J. Comput., 1985

New Data Structures for Orthogonal Range Queries.

[BibT_eX]

[DOI]

Dan E. Willard

SIAM J. Comput., 1985

Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract).

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the STACS 85, 1985

1984

New Trie Data Structures Which Support Very Fast Search Operations.

[BibT_eX]

[DOI]

Dan E. Willard

J. Comput. Syst. Sci., 1984

Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report)

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Efficient Processing of Relational Calculus Expressions Using Range Query Theory.

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the SIGMOD'84, 1984

Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract).

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the Automata, 1984

1983

Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N).

[BibT_eX]

[DOI]

Dan E. Willard

Inf. Process. Lett., 1983

1982

Polygon Retrieval.

[BibT_eX]

[DOI]

Dan E. Willard

SIAM J. Comput., 1982

A Data Structure for Dynamic Range Queries.

[BibT_eX]

[DOI]

George S. Lueker

Dan E. Willard

Inf. Process. Lett., 1982

Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract)

[BibT_eX]

[DOI]

Dan E. Willard

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1978

Predicate-Oriented Database Search Algorithms

[BibT_eX]

Dan E. Willard

Outstanding Dissertations in the Computer Sciences, Garland Publishing, New York, ISBN: 0-8240-4405-3, 1978

Dan E. Willard

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...