Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2009 | ||
---|---|---|

46 | Dan E. Willard:
Some specially formulated axiomizations for ISigma_{0} manage to evade the Herbrandized version of the Second Incompleteness Theorem.
Inf. Comput. 207(10): 1078-1093 (2009) | |

2007 | ||

45 | Dan E. Willard: Passive induction and a solution to a Paris-Wilkie open question. Ann. Pure Appl. Logic 146(2-3): 124-149 (2007) | |

2006 | ||

44 | Dan E. Willard: A generalization of the Second Incompleteness Theorem and some exceptions to it. Ann. Pure Appl. Logic 141(3): 472-496 (2006) | |

43 | Dan E. Willard:
The Axiom System ISigma_{0} Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem.
Electr. Notes Theor. Comput. Sci. 165: 213-226 (2006) | |

2005 | ||

42 | Dan E. Willard: On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency. TABLEAUX 2005: 292-306 | |

2002 | ||

41 | Dan E. Willard: Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem. TABLEAUX 2002: 281-297 | |

40 | Dan E. Willard: An Algorithm for Handling Many Relational Calculus Queries Efficiently. J. Comput. Syst. Sci. 65(2): 295-331 (2002) | |

39 | 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) | |

2001 | ||

38 | Dan E. Willard: Self-Verifying Axiom Systems, The Incompleteness Theorem and Related Reflection Principles. J. Symb. Log. 66(2): 536-596 (2001) | |

2000 | ||

37 | Dan E. Willard: The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q. TABLEAUX 2000: 415-430 | |

36 | 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) | |

1997 | ||

35 | Dan E. Willard: The Tangibility Reflection Principle for Self-Verifying Axiom Systems. Kurt Gödel Colloquium 1997: 319-334 | |

1996 | ||

34 | 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) | |

1994 | ||

33 | 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 | ||

32 | Dan E. Willard: Self-Verifying Axiom Systems. Kurt Gödel Colloquium 1993: 325-336 | |

31 | Michael L. Fredman, Dan E. Willard: Surpassing the Information Theoretic Bound with Fusion Trees. J. Comput. Syst. Sci. 47(3): 424-436 (1993) | |

1992 | ||

30 | Dan E. Willard: Applications of the Fusion Tree Method to Computational Geometry and Searching. SODA 1992: 286-295 | |

29 | 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) | |

1991 | ||

28 | Dan E. Willard: Optimal Sample Cost Residues for Differential Database Batch Query Problems. J. ACM 38(1): 104-119 (1991) | |

1990 | ||

27 | 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 | |

26 | Michael L. Fredman, Dan E. Willard: Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths FOCS 1990: 719-725 | |

25 | Dan E. Willard: Quasilinear Algorithms for Processing Relational Calculus Expressions. PODS 1990: 243-257 | |

24 | Michael L. Fredman, Dan E. Willard: BLASTING through the Information Theoretic Barrier with FUSION TREES STOC 1990: 1-7 | |

23 | Young C. Wee, Seth Chaiken, Dan E. Willard: On the Angle Restricted Nearest Neighbor Problem. Inf. Process. Lett. 34(2): 71-76 (1990) | |

1989 | ||

22 | Dan E. Willard, John H. Reif: Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search Inf. Comput. 81(3): 364-379 (1989) | |

21 | 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 | ||

20 | Dan E. Willard, Young C. Wee: Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. Symposium on Computational Geometry 1988: 34-43 | |

1987 | ||

19 | Dan E. Willard: Multidimensional search trees that provide new types of memory reductions. J. ACM 34(4): 846-858 (1987) | |

1986 | ||

18 | Dan E. Willard: Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract). ICALP 1986: 444-453 | |

17 | Dan E. Willard: Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files. SIGMOD Conference 1986: 251-260 | |

16 | Dan E. Willard: On the Application of Shared Retrieval to Orthogonal Range Queries. Symposium on Computational Geometry 1986: 80-89 | |

15 | Dan E. Willard: Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel. SIAM J. Comput. 15(2): 468-477 (1986) | |

1985 | ||

14 | Dan E. Willard: Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract). STACS 1985: 363-374 | |

13 | 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) | |

12 | Dan E. Willard, George S. Lueker: Adding Range Restriction Capability to Dynamic Data Structures J. ACM 32(3): 597-617 (1985) | |

11 | Dan E. Willard: New Data Structures for Orthogonal Range Queries. SIAM J. Comput. 14(1): 232-253 (1985) | |

10 | Dan E. Willard: Searching Unindexed and Nonuniformly Generated Files in log log N Time. SIAM J. Comput. 14(4): 1013-1029 (1985) | |

1984 | ||

9 | Dan E. Willard: Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract). ICALP 1984: 514-526 | |

8 | Dan E. Willard: Efficient Processing of Relational Calculus Expressions Using Range Query Theory. SIGMOD Conference 1984: 164-175 | |

7 | Dan E. Willard: Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report) STOC 1984: 512-521 | |

6 | Dan E. Willard: New Trie Data Structures Which Support Very Fast Search Operations. J. Comput. Syst. Sci. 28(3): 379-394 (1984) | |

1983 | ||

5 | Dan E. Willard: Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). Inf. Process. Lett. 17(2): 81-84 (1983) | |

1982 | ||

4 | Dan E. Willard: Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract) STOC 1982: 114-121 | |

3 | George S. Lueker, Dan E. Willard: A Data Structure for Dynamic Range Queries. Inf. Process. Lett. 15(5): 209-213 (1982) | |

2 | Dan E. Willard: Polygon Retrieval. SIAM J. Comput. 11(1): 149-165 (1982) | |

1978 | ||

1 | Dan E. Willard: Predicate-Oriented Database Search Algorithms Garland Publishing, New York 1978 |

1 | Brenda S. Baker | [13] |

2 | Seth Chaiken | [23] [27] |

3 | Edward G. Coffman Jr. | [13] |

4 | Michael L. Fredman | [24] [26] [31] [33] |

5 | George S. Lueker | [3] [12] |

6 | John H. Reif | [22] |

7 | Young C. Wee | [20] [23] [27] |