default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan E. Willard
Person information
- affiliation: University at Albany, SUNY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j28]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): 375-392 (2021)- 2020
- [c23]Dan E. Willard:
On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction. LFCS 2020: 268-286
2010 – 2019
- 2014
- [c22]Dan E. Willard:
On the Broader Epistemological Significance of Self-Justifying Axiom Systems. WoLLIC 2014: 221-236 - 2013
- [i1]Dan E. Willard:
On the Significance of Self-Justifying Axiom Systems from the Perspective of Analytic Tableaux. CoRR abs/1307.0150 (2013)
2000 – 2009
- 2009
- [j27]Dan E. Willard:
Some specially formulated axiomizations for ISigma0 manage to evade the Herbrandized version of the Second Incompleteness Theorem. Inf. Comput. 207(10): 1078-1093 (2009) - 2007
- [j26]Dan E. Willard:
Passive induction and a solution to a Paris-Wilkie open question. Ann. Pure Appl. Log. 146(2-3): 124-149 (2007) - 2006
- [j25]Dan E. Willard:
A generalization of the Second Incompleteness Theorem and some exceptions to it. Ann. Pure Appl. Log. 141(3): 472-496 (2006) - [j24]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): 1189-1199 (2006) - [c21]Dan E. Willard:
The Axiom System ISigma0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem. WoLLIC 2006: 213-226 - 2005
- [j23]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): 1171-1209 (2005) - [c20]Dan E. Willard:
On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency. TABLEAUX 2005: 292-306 - 2002
- [j22]Dan E. Willard:
An Algorithm for Handling Many Relational Calculus Queries Efficiently. J. Comput. Syst. Sci. 65(2): 295-331 (2002) - [j21]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): 465-496 (2002) - [c19]Dan E. Willard:
Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem. TABLEAUX 2002: 281-297 - 2001
- [j20]Dan E. Willard:
Self-Verifying Axiom Systems, The Incompleteness Theorem and Related Reflection Principles. J. Symb. Log. 66(2): 536-596 (2001) - 2000
- [j19]Dan E. Willard:
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree. SIAM J. Comput. 29(3): 1030-1049 (2000) - [c18]Dan E. Willard:
The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q. TABLEAUX 2000: 415-430
1990 – 1999
- 1997
- [c17]Dan E. Willard:
The Tangibility Reflection Principle for Self-Verifying Axiom Systems. Kurt Gödel Colloquium 1997: 319-334 - 1996
- [j18]Dan E. Willard:
Applications of Range Query Theory to Relational Data Base Join and Selection Operations. J. Comput. Syst. Sci. 52(1): 157-169 (1996) - [c16]Dan E. Willard:
Self-reflection principles and NP-hardness. Proof Complexity and Feasible Arithmetics 1996: 297-320 - 1994
- [j17]Michael L. Fredman, Dan E. Willard:
Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comput. Syst. Sci. 48(3): 533-551 (1994) - 1993
- [j16]Michael L. Fredman, Dan E. Willard:
Surpassing the Information Theoretic Bound with Fusion Trees. J. Comput. Syst. Sci. 47(3): 424-436 (1993) - [c15]Dan E. Willard:
Self-Verifying Axiom Systems. Kurt Gödel Colloquium 1993: 325-336 - 1992
- [j15]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): 150-204 (1992) - [c14]Dan E. Willard:
Applications of the Fusion Tree Method to Computational Geometry and Searching. SODA 1992: 286-295 - 1991
- [j14]Dan E. Willard:
Optimal Sample Cost Residues for Differential Database Batch Query Problems. J. ACM 38(1): 104-119 (1991) - 1990
- [j13]Young C. Wee, Seth Chaiken, Dan E. Willard:
On the Angle Restricted Nearest Neighbor Problem. Inf. Process. Lett. 34(2): 71-76 (1990) - [c13]Young C. Wee, Seth Chaiken, Dan E. Willard:
Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version). ACM Conference on Computer Science 1990: 49-55 - [c12]Michael L. Fredman, Dan E. Willard:
Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. FOCS 1990: 719-725 - [c11]Dan E. Willard:
Quasilinear Algorithms for Processing Relational Calculus Expressions. PODS 1990: 243-257 - [c10]Michael L. Fredman, Dan E. Willard:
BLASTING through the Information Theoretic Barrier with FUSION TREES. STOC 1990: 1-7
1980 – 1989
- 1989
- [j12]Dan E. Willard, John H. Reif:
Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search. Inf. Comput. 81(3): 364-379 (1989) - [j11]Dan E. Willard:
Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems. Inf. Comput. 82(1): 45-64 (1989) - 1988
- [c9]Dan E. Willard, Young C. Wee:
Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. SCG 1988: 34-43 - 1987
- [j10]Dan E. Willard:
Multidimensional search trees that provide new types of memory reductions. J. ACM 34(4): 846-858 (1987) - 1986
- [j9]Dan E. Willard:
Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel. SIAM J. Comput. 15(2): 468-477 (1986) - [c8]Dan E. Willard:
On the Application of Shared Retrieval to Orthogonal Range Queries. SCG 1986: 80-89 - [c7]Dan E. Willard:
Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract). ICALP 1986: 444-453 - [c6]Dan E. Willard:
Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files. SIGMOD Conference 1986: 251-260 - 1985
- [j8]Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard:
Algorithms for Resolving Conflicts in Dynamic Storage Allocation. J. ACM 32(2): 327-343 (1985) - [j7]Dan E. Willard, George S. Lueker:
Adding Range Restriction Capability to Dynamic Data Structures. J. ACM 32(3): 597-617 (1985) - [j6]Dan E. Willard:
New Data Structures for Orthogonal Range Queries. SIAM J. Comput. 14(1): 232-253 (1985) - [j5]Dan E. Willard:
Searching Unindexed and Nonuniformly Generated Files in log log N Time. SIAM J. Comput. 14(4): 1013-1029 (1985) - [c5]Dan E. Willard:
Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract). STACS 1985: 363-374 - 1984
- [j4]Dan E. Willard:
New Trie Data Structures Which Support Very Fast Search Operations. J. Comput. Syst. Sci. 28(3): 379-394 (1984) - [c4]Dan E. Willard:
Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract). ICALP 1984: 514-526 - [c3]Dan E. Willard:
Efficient Processing of Relational Calculus Expressions Using Range Query Theory. SIGMOD Conference 1984: 164-175 - [c2]Dan E. Willard:
Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report). STOC 1984: 512-521 - 1983
- [j3]Dan E. Willard:
Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). Inf. Process. Lett. 17(2): 81-84 (1983) - 1982
- [j2]George S. Lueker, Dan E. Willard:
A Data Structure for Dynamic Range Queries. Inf. Process. Lett. 15(5): 209-213 (1982) - [j1]Dan E. Willard:
Polygon Retrieval. SIAM J. Comput. 11(1): 149-165 (1982) - [c1]Dan E. Willard:
Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract). STOC 1982: 114-121
1970 – 1979
- 1978
- [b1]Dan E. Willard:
Predicate-Oriented Database Search Algorithms. Outstanding Dissertations in the Computer Sciences, Garland Publishing, New York 1978, ISBN 0-8240-4405-3
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
