The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joseph Douglas Horton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bruce Spencer, Joseph Douglas Horton
    Extending the Regular Restriction of Resolution to Non-Linear Subdeductions. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1997, pp:478-483 [Conf]
  2. Joseph Douglas Horton, Bruce Spencer
    Rank/Activity: A Canonical Form for Binary Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1998, pp:412-426 [Conf]
  3. Bruce Spencer, Joseph Douglas Horton
    Support Ordered Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:385-400 [Conf]
  4. Therese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar
    Searching for the center of a circle. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:137-141 [Conf]
  5. Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz
    Cross-Stitching Using Little Thread. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:199-202 [Conf]
  6. Michael G. Lamoureux, Joseph Douglas Horton, Bradford G. Nickerson
    Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  7. Therese C. Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper
    Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:90-101 [Conf]
  8. Joseph Douglas Horton, Alejandro López-Ortiz
    On the number of distributed measurement points for network tomography. [Citation Graph (0, 0)][DBLP]
    Internet Measurement Comference, 2003, pp:204-209 [Conf]
  9. Alexander Golynski, Joseph Douglas Horton
    A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:200-209 [Conf]
  10. Peter Baumgartner, Joseph Douglas Horton, Bruce Spencer
    Merge Path Improvements for Minimal Model Hyper Tableaux. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1999, pp:51-65 [Conf]
  11. Joseph Douglas Horton, Bruce Spencer
    Clause Trees: A Tool for Understanding and Implementing Resolution in Automated Reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:92, n:1-2, pp:25-89 [Journal]
  12. Joseph Douglas Horton, Walter D. Wallis
    Factoring the cartesian product of a cubic graph and a triangle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:137-146 [Journal]
  13. Bruce Spencer, Joseph Douglas Horton
    Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2000, v:25, n:1, pp:1-34 [Journal]
  14. Joseph Douglas Horton, R. H. Cooper, W. F. Hyslop, Bradford G. Nickerson, O. K. Ward, R. Harland, E. Ashby, W. M. Stewart
    The Cascade Vulnerability Problem. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 1993, v:2, n:4, pp:279-290 [Journal]
  15. Mark N. Ellingham, Joseph Douglas Horton
    Non-hamiltonian 3-connected cubic bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:350-353 [Journal]
  16. Joseph Douglas Horton
    Sub-Latin Squares and Incomplete Orthogonal Arrays. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:16, n:1, pp:23-33 [Journal]
  17. Joseph Douglas Horton
    Resolvable Path Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:39, n:2, pp:117-131 [Journal]
  18. J. G. Kalbfleisch, R. G. Stanton, Joseph Douglas Horton
    On Covering Sets and Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1971, v:11, n:3, pp:233-250 [Journal]
  19. R. G. Stanton, Joseph Douglas Horton
    A Multiplication Theorem for Room Squares. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1972, v:12, n:3, pp:322-325 [Journal]
  20. Joseph Douglas Horton
    A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:2, pp:358-366 [Journal]

Search in 0.003secs, Finished in 0.004secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002