Dan E. Willard

53 papers A* 8A 1B 3C 2Misc 1Journal 29Unranked 8

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	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. Dan E. Willard
2020	Misc	`conf`	On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction. LFCS Dan E. Willard
2014	C	`conf`	On the Broader Epistemological Significance of Self-Justifying Axiom Systems. WoLLIC Dan E. Willard
2013	J	`jnl`	On the Significance of Self-Justifying Axiom Systems from the Perspective of Analytic Tableaux. CoRR Dan E. Willard
2009	J	`jnl`	Some specially formulated axiomizations for ISigma Inf. Comput. Dan E. Willard
2007	J	`jnl`	Passive induction and a solution to a Paris-Wilkie open question. Ann. Pure Appl. Log. Dan E. Willard
2006	J	`jnl`	A generalization of the Second Incompleteness Theorem and some exceptions to it. Ann. Pure Appl. Log. Dan E. Willard
2006	J	`jnl`	On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency. J. Symb. Log. Dan E. Willard
2006	C	`conf`	The Axiom System ISigma WoLLIC Dan E. Willard
2005	J	`jnl`	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. Dan E. Willard
2005	B	`conf`	On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency. TABLEAUX Dan E. Willard
2002	J	`jnl`	An Algorithm for Handling Many Relational Calculus Queries Efficiently. J. Comput. Syst. Sci. Dan E. Willard
2002	J	`jnl`	How to Extend The Semantic Tableaux and Cut-Free Versions of The Second Incompleteness Theorem Almost to Robinson's Arithmetic Q. J. Symb. Log. Dan E. Willard
2002	B	`conf`	Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem. TABLEAUX Dan E. Willard
2001	J	`jnl`	Self-Verifying Axiom Systems, The Incompleteness Theorem and Related Reflection Principles. J. Symb. Log. Dan E. Willard
2000	J	`jnl`	Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree. SIAM J. Comput. Dan E. Willard
2000	B	`conf`	The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q. TABLEAUX Dan E. Willard
1997	—	`conf`	The Tangibility Reflection Principle for Self-Verifying Axiom Systems. Kurt Gödel Colloquium Dan E. Willard
1996	J	`jnl`	Applications of Range Query Theory to Relational Data Base Join and Selection Operations. J. Comput. Syst. Sci. Dan E. Willard
1996	—	`conf`	Self-reflection principles and NP-hardness. Proof Complexity and Feasible Arithmetics Dan E. Willard
1994	J	`jnl`	Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comput. Syst. Sci. Michael L. Fredman, Dan E. Willard
1993	—	`conf`	Self-Verifying Axiom Systems. Kurt Gödel Colloquium Dan E. Willard
1993	J	`jnl`	Surpassing the Information Theoretic Bound with Fusion Trees. J. Comput. Syst. Sci. Michael L. Fredman, Dan E. Willard
1992	J	`jnl`	A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time Inf. Comput. Dan E. Willard
1992	A*	`conf`	Applications of the Fusion Tree Method to Computational Geometry and Searching. SODA Dan E. Willard
1991	J	`jnl`	Optimal Sample Cost Residues for Differential Database Batch Query Problems. J. ACM Dan E. Willard
1990	A*	`conf`	BLASTING through the Information Theoretic Barrier with FUSION TREES STOC Michael L. Fredman, Dan E. Willard
1990	—	`conf`	Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version). ACM Conference on Computer Science Young C. Wee, Seth Chaiken, Dan E. Willard
1990	J	`jnl`	On the Angle Restricted Nearest Neighbor Problem. Inf. Process. Lett. Young C. Wee, Seth Chaiken, Dan E. Willard
1990	A*	`conf`	Quasilinear Algorithms for Processing Relational Calculus Expressions. PODS Dan E. Willard
1990	A*	`conf`	Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths FOCS Michael L. Fredman, Dan E. Willard
1989	J	`jnl`	Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems Inf. Comput. Dan E. Willard
1989	J	`jnl`	Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search Inf. Comput. Dan E. Willard, John H. Reif
1988	—	`conf`	Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. SCG Dan E. Willard, Young C. Wee
1987	J	`jnl`	Multidimensional search trees that provide new types of memory reductions. J. ACM Dan E. Willard
1986	—	`conf`	Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files. SIGMOD Conference Dan E. Willard
1986	J	`jnl`	Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel. SIAM J. Comput. Dan E. Willard
1986	A*	`conf`	Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract). ICALP Dan E. Willard
1986	—	`conf`	On the Application of Shared Retrieval to Orthogonal Range Queries. SCG Dan E. Willard
1985	J	`jnl`	Adding Range Restriction Capability to Dynamic Data Structures J. ACM Dan E. Willard, George S. Lueker
1985	J	`jnl`	Algorithms for Resolving Conflicts in Dynamic Storage Allocation J. ACM Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard
1985	J	`jnl`	New Data Structures for Orthogonal Range Queries. SIAM J. Comput. Dan E. Willard
1985	A	`conf`	Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract). STACS Dan E. Willard
1985	J	`jnl`	Searching Unindexed and Nonuniformly Generated Files in log log N Time. SIAM J. Comput. Dan E. Willard
1984	—	`conf`	Efficient Processing of Relational Calculus Expressions Using Range Query Theory. SIGMOD Conference Dan E. Willard
1984	A*	`conf`	Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report) STOC Dan E. Willard
1984	J	`jnl`	New Trie Data Structures Which Support Very Fast Search Operations. J. Comput. Syst. Sci. Dan E. Willard
1984	A*	`conf`	Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract). ICALP Dan E. Willard
1983	J	`jnl`	Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). Inf. Process. Lett. Dan E. Willard
1982	J	`jnl`	A Data Structure for Dynamic Range Queries. Inf. Process. Lett. George S. Lueker, Dan E. Willard
1982	A*	`conf`	Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract) STOC Dan E. Willard
1982	J	`jnl`	Polygon Retrieval. SIAM J. Comput. Dan E. Willard
1978	—	`book`	Predicate-Oriented Database Search Algorithms Dan E. Willard