The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Dan E. Willard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dan E. Willard
    Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract). [Citation Graph (5, 0)][DBLP]
    ICALP, 1984, pp:514-526 [Conf]
  2. Dan E. Willard
    Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). [Citation Graph (4, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:2, pp:81-84 [Journal]
  3. Dan E. Willard
    Optimal Sample Cost Residues for Differential Database Batch Query Problems. [Citation Graph (4, 0)][DBLP]
    J. ACM, 1991, v:38, n:1, pp:104-119 [Journal]
  4. Dan E. Willard, George S. Lueker
    Adding Range Restriction Capability to Dynamic Data Structures [Citation Graph (4, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:597-617 [Journal]
  5. Dan E. Willard
    New Data Structures for Orthogonal Range Queries. [Citation Graph (4, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:232-253 [Journal]
  6. Dan E. Willard
    Efficient Processing of Relational Calculus Expressions Using Range Query Theory. [Citation Graph (3, 47)][DBLP]
    SIGMOD Conference, 1984, pp:164-175 [Conf]
  7. Dan E. Willard
    Polygon Retrieval. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:149-165 [Journal]
  8. Dan E. Willard
    New Trie Data Structures Which Support Very Fast Search Operations. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:379-394 [Journal]
  9. Dan E. Willard
    Searching Unindexed and Nonuniformly Generated Files in log log N Time. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:1013-1029 [Journal]
  10. Dan E. Willard
    Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1982, pp:114-121 [Conf]
  11. Dan E. Willard
    Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report) [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:512-521 [Conf]
  12. Dan E. Willard
    Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:1, pp:45-64 [Journal]
  13. Dan E. Willard
    A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1992, v:97, n:2, pp:150-204 [Journal]
  14. Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard
    Algorithms for Resolving Conflicts in Dynamic Storage Allocation [Citation Graph (1, 0)][DBLP]
    J. ACM, 1985, v:32, n:2, pp:327-343 [Journal]
  15. Dan E. Willard
    Multidimensional search trees that provide new types of memory reductions. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1987, v:34, n:4, pp:846-858 [Journal]
  16. Michael L. Fredman, Dan E. Willard
    Surpassing the Information Theoretic Bound with Fusion Trees. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:3, pp:424-436 [Journal]
  17. Young C. Wee, Seth Chaiken, Dan E. Willard
    Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1990, pp:49-55 [Conf]
  18. Dan E. Willard
    On the Application of Shared Retrieval to Orthogonal Range Queries. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:80-89 [Conf]
  19. Dan E. Willard, Young C. Wee
    Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:34-43 [Conf]
  20. Michael L. Fredman, Dan E. Willard
    Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:719-725 [Conf]
  21. Dan E. Willard
    Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:444-453 [Conf]
  22. Dan E. Willard
    Self-Verifying Axiom Systems. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:325-336 [Conf]
  23. Dan E. Willard
    The Tangibility Reflection Principle for Self-Verifying Axiom Systems. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:319-334 [Conf]
  24. Dan E. Willard
    Quasilinear Algorithms for Processing Relational Calculus Expressions. [Citation Graph (0, 26)][DBLP]
    PODS, 1990, pp:243-257 [Conf]
  25. Dan E. Willard
    Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files. [Citation Graph (0, 8)][DBLP]
    SIGMOD Conference, 1986, pp:251-260 [Conf]
  26. Dan E. Willard
    Applications of the Fusion Tree Method to Computational Geometry and Searching. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:286-295 [Conf]
  27. Dan E. Willard
    Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:363-374 [Conf]
  28. Michael L. Fredman, Dan E. Willard
    BLASTING through the Information Theoretic Barrier with FUSION TREES [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:1-7 [Conf]
  29. Dan E. Willard
    The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2000, pp:415-430 [Conf]
  30. Dan E. Willard
    Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2002, pp:281-297 [Conf]
  31. Dan E. Willard
    On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2005, pp:292-306 [Conf]
  32. Dan E. Willard
    A generalization of the Second Incompleteness Theorem and some exceptions to it. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:472-496 [Journal]
  33. Dan E. Willard
    The Axiom System ISigma0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:165, n:, pp:213-226 [Journal]
  34. Dan E. Willard, John H. Reif
    Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:81, n:3, pp:364-379 [Journal]
  35. George S. Lueker, Dan E. Willard
    A Data Structure for Dynamic Range Queries. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:5, pp:209-213 [Journal]
  36. Young C. Wee, Seth Chaiken, Dan E. Willard
    On the Angle Restricted Nearest Neighbor Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:2, pp:71-76 [Journal]
  37. Michael L. Fredman, Dan E. Willard
    Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:3, pp:533-551 [Journal]
  38. Dan E. Willard
    An Algorithm for Handling Many Relational Calculus Queries Efficiently. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:2, pp:295-331 [Journal]
  39. Dan E. Willard
    Applications of Range Query Theory to Relational Data Base Join and Selection Operations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:157-169 [Journal]
  40. Dan E. Willard
    Self-Verifying Axiom Systems, The Incompleteness Theorem and Related Reflection Principles. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:536-596 [Journal]
  41. Dan E. Willard
    How to Extend The Semantic Tableaux and Cut-Free Versions of The Second Incompleteness Theorem Almost to Robinson's Arithmetic Q. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:465-496 [Journal]
  42. Dan E. Willard
    Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:3, pp:1030-1049 [Journal]
  43. Dan E. Willard
    Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:468-477 [Journal]
  44. Dan E. Willard
    Passive induction and a solution to a Paris-Wilkie open question. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2007, v:146, n:2-3, pp:124-149 [Journal]

Search in 0.003secs, Finished in 0.306secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002