Joseph Douglas Horton

Affiliations:
  • University of New Brunswick, Canada


According to our database1, Joseph Douglas Horton authored at least 35 papers between 1971 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
An Algorithm for Quantum Template Matching.
ACM J. Emerg. Technol. Comput. Syst., 2014

2013
Conditioning on Disjunctive Knowledge: Defaults and Probabilities
CoRR, 2013

A Long Term Proposal to Simulate Consciousness in Artificial Life.
Proceedings of the ICAART 2013, 2013

2011
Assigning routes and wavelengths for collaboration over optical networks.
Photonic Netw. Commun., 2011

2010
A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees.
J. Comput. Biol., 2010

2005
Minimum cycle bases of graphs over different fields.
Electron. Notes Discret. Math., 2005

Cross-Stitching Using Little Thread.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2003
On the number of distributed measurement points for network tomography.
Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.
Proceedings of the Algorithms, 2003

2002
Factoring the cartesian product of a cubic graph and a triangle.
Discret. Math., 2002

A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.
Proceedings of the Algorithm Theory, 2002

Searching for the center of a circle.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Counting the Number of Equivalent Binary Resolution Proofs.
Proceedings of the Logic for Programming, 2001

2000
Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution.
J. Autom. Reason., 2000

Support Ordered Resolution.
Proceedings of the Automated Deduction, 2000

1999
Merge Path Improvements for Minimal Model Hyper Tableaux.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

1998
Rank/Activity: A Canonical Form for Binary Resolution.
Proceedings of the Automated Deduction, 1998

1997
Clause Trees: A Tool for Understanding and Implementing Resolution in Automated Reasoning.
Artif. Intell., 1997

Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

Extending the Regular Restriction of Resolution to Non-Linear Subdeductions.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1993
Minimum Edge Dominating Sets.
SIAM J. Discret. Math., 1993

The Cascade Vulnerability Problem.
J. Comput. Secur., 1993

1991
Symmetric <i>Y</i>-graphs and <i>H</i>-graphs.
J. Comb. Theory B, 1991

Self-orthogonal Hamilton path decompositions.
Discret. Math., 1991

A hyperfactorization of order 8, index 2.
Discret. Math., 1991

1990
Orthogonal starters in finite abelian groups.
Discret. Math., 1990

1989
Conditioning on Disjunctive Knowledge: Simpson's Paradox in Default Logic.
Proceedings of the UAI '89: Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence, 1989

1987
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph.
SIAM J. Comput., 1987

1985
Resolvable Path Designs.
J. Comb. Theory A, 1985

1983
Non-hamiltonian 3-connected cubic bipartite graphs.
J. Comb. Theory B, 1983

The construction of Kotzig factorizations.
Discret. Math., 1983

1982
On two-factors of bipartite regular graphs.
Discret. Math., 1982

1974
Sub-Latin Squares and Incomplete Orthogonal Arrays.
J. Comb. Theory A, 1974

1972
A Multiplication Theorem for Room Squares.
J. Comb. Theory A, 1972

1971
On Covering Sets and Error-Correcting Codes.
J. Comb. Theory A, 1971


  Loading...