default search action
Joseph Douglas Horton
Person information
- affiliation: University of New Brunswick, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j21]Md. Mazder Rahman, Gerhard W. Dueck, Joseph D. Horton:
An Algorithm for Quantum Template Matching. ACM J. Emerg. Technol. Comput. Syst. 11(3): 31:1-31:20 (2014) - 2013
- [c14]Joseph D. Horton, Michael Francis, Eckart Sußenburger:
A Long Term Proposal to Simulate Consciousness in Artificial Life. ICAART (2) 2013: 389-394 - [i1]Eric Neufeld, Joseph Douglas Horton:
Conditioning on Disjunctive Knowledge: Defaults and Probabilities. CoRR abs/1304.1521 (2013) - 2011
- [j20]Yosri Harzallah, Joseph D. Horton, Bruce Spencer:
Assigning routes and wavelengths for collaboration over optical networks. Photonic Netw. Commun. 22(1): 1-12 (2011) - 2010
- [j19]Duong Dai Doan, Patricia A. Evans, Joseph D. Horton:
A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees. J. Comput. Biol. 17(10): 1451-1465 (2010)
2000 – 2009
- 2005
- [j18]Joseph D. Horton, Franziska Berger:
Minimum cycle bases of graphs over different fields. Electron. Notes Discret. Math. 22: 501-505 (2005) - [c13]Therese Biedl, Joseph Douglas Horton, Alejandro López-Ortiz:
Cross-Stitching Using Little Thread. CCCG 2005: 199-202 - 2003
- [c12]Therese 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. ESA 2003: 90-101 - [c11]Joseph Douglas Horton, Alejandro López-Ortiz:
On the number of distributed measurement points for network tomography. Internet Measurement Conference 2003: 204-209 - 2002
- [j17]Joseph Douglas Horton, Walter D. Wallis:
Factoring the cartesian product of a cubic graph and a triangle. Discret. Math. 259(1-3): 137-146 (2002) - [c10]Therese Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar:
Searching for the center of a circle. CCCG 2002: 137-141 - [c9]Alexander Golynski, Joseph Douglas Horton:
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. SWAT 2002: 200-209 - 2001
- [c8]Joseph D. Horton:
Counting the Number of Equivalent Binary Resolution Proofs. LPAR 2001: 157-171 - 2000
- [j16]Bruce Spencer, Joseph Douglas Horton:
Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution. J. Autom. Reason. 25(1): 1-34 (2000) - [c7]Bruce Spencer, Joseph Douglas Horton:
Support Ordered Resolution. CADE 2000: 385-400
1990 – 1999
- 1999
- [c6]Peter Baumgartner, Joseph Douglas Horton, Bruce Spencer:
Merge Path Improvements for Minimal Model Hyper Tableaux. TABLEAUX 1999: 51-65 - 1998
- [c5]Joseph Douglas Horton, Bruce Spencer:
Rank/Activity: A Canonical Form for Binary Resolution. CADE 1998: 412-426 - 1997
- [j15]Joseph Douglas Horton, Bruce Spencer:
Clause Trees: A Tool for Understanding and Implementing Resolution in Automated Reasoning. Artif. Intell. 92(1-2): 25-89 (1997) - [c4]Bruce Spencer, Joseph Douglas Horton:
Extending the Regular Restriction of Resolution to Non-Linear Subdeductions. AAAI/IAAI 1997: 478-483 - [c3]Michael G. Lamoureux, Joseph Douglas Horton, Bradford G. Nickerson:
Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited. CCCG 1997 - 1993
- [j14]Joseph Douglas Horton, Rodney H. Cooper, W. F. Hyslop, Bradford G. Nickerson, O. K. Ward, Robert Harland, Elton Ashby, W. M. Stewart:
The Cascade Vulnerability Problem. J. Comput. Secur. 2(4): 279-290 (1993) - [j13]Joseph Douglas Horton, Kyriakos Kilakos:
Minimum Edge Dominating Sets. SIAM J. Discret. Math. 6(3): 375-387 (1993) - [c2]Joseph D. Horton, Robert Harland, Elton Ashby, Rodney H. Cooper, W. F. Hyslop, Bradford G. Nickerson, W. M. Stewart, O. K. Ward:
The cascade vulnerability problem. S&P 1993: 110-116 - 1991
- [j12]Joseph Douglas Horton:
A hyperfactorization of order 8, index 2. Discret. Math. 92(1-3): 127-129 (1991) - [j11]Joseph Douglas Horton, Gillian M. Nonay:
Self-orthogonal Hamilton path decompositions. Discret. Math. 97(1-3): 251-264 (1991) - [j10]Joseph Douglas Horton, I. Z. Bouwer:
Symmetric Y-graphs and H-graphs. J. Comb. Theory B 53(1): 114-129 (1991) - 1990
- [j9]Joseph Douglas Horton:
Orthogonal starters in finite abelian groups. Discret. Math. 79(3): 265-278 (1990)
1980 – 1989
- 1989
- [c1]Eric Neufeld, Joseph Douglas Horton:
Conditioning on Disjunctive Knowledge: Simpson's Paradox in Default Logic. UAI 1989: 117-128 - 1987
- [j8]Joseph Douglas Horton:
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph. SIAM J. Comput. 16(2): 358-366 (1987) - 1985
- [j7]Joseph Douglas Horton:
Resolvable Path Designs. J. Comb. Theory A 39(2): 117-131 (1985) - 1983
- [j6]Joseph Douglas Horton:
The construction of Kotzig factorizations. Discret. Math. 43(2-3): 199-206 (1983) - [j5]Mark N. Ellingham, Joseph Douglas Horton:
Non-hamiltonian 3-connected cubic bipartite graphs. J. Comb. Theory B 34(3): 350-353 (1983) - 1982
- [j4]Joseph Douglas Horton:
On two-factors of bipartite regular graphs. Discret. Math. 41(1): 35-41 (1982)
1970 – 1979
- 1974
- [j3]Joseph Douglas Horton:
Sub-Latin Squares and Incomplete Orthogonal Arrays. J. Comb. Theory A 16(1): 23-33 (1974) - 1972
- [j2]R. G. Stanton, Joseph Douglas Horton:
A Multiplication Theorem for Room Squares. J. Comb. Theory A 12(3): 322-325 (1972) - 1971
- [j1]J. G. Kalbfleisch, R. G. Stanton, Joseph Douglas Horton:
On Covering Sets and Error-Correcting Codes. J. Comb. Theory A 11(3): 233-250 (1971)
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-07-03 20:44 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: