J. D. Horton

From MaRDI portal
Person:1052334

Available identifiers

zbMath Open horton.joseph-dMaRDI QIDQ1052334

List of research outcomes





PublicationDate of PublicationType
Counting the number of equivalent binary resolution proofs2011-05-06Paper
Optimal dynamic video-on-demand using adaptive broadcasting2010-03-03Paper
Minimum cycle bases of graphs over different fields2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q30464922004-08-12Paper
Clause trees: A tool for understanding and implementing resolution in automated reasoning2003-08-28Paper
Factoring the Cartesian product of a cubic graph and a triangle2003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q27234332001-07-05Paper
Efficient algorithms to detect and restore minimality, an extension of the regular restriction of resolution2000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q42630062000-02-28Paper
https://portal.mardi4nfdi.de/entity/Q42499051999-09-15Paper
Minimum Edge Dominating Sets1993-10-14Paper
Self-orthogonal Hamilton path decompositions1992-06-28Paper
A hyperfactorization of order 8, index 21992-06-28Paper
Orthogonal starters in finite abelian groups1992-06-25Paper
Evaluation of the discrepancy of the linear congruential pseudo-random number sequences1992-06-25Paper
Symmetric Y-graphs and H-graphs1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57535561990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38190811989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38310531989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38221811988-01-01Paper
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph1987-01-01Paper
Resolvable path designs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37206431985-01-01Paper
Sets with No Empty Convex 7-Gons1983-01-01Paper
The construction of Kotzig factorizations1983-01-01Paper
Non-Hamiltonian 3-connected cubic bipartite graphs1983-01-01Paper
On two-factors of bipartite regular graphs1982-01-01Paper
Room designs and one-factorizations1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39553561981-01-01Paper
Sub-Latin squares and incomplete orthogonal arrays1974-01-01Paper
A multiplication theorem for Room squares1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56850971972-01-01Paper
A recursive construction for Room designs1971-01-01Paper
Quintuplication of Room squares1971-01-01Paper
On covering sets and error-correcting codes1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773071971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56619001970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56183891970-01-01Paper
Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components1969-01-01Paper

Research outcomes over time

This page was built for person: J. D. Horton