List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Feasibility checking in Horn constraint systems through a reduction based approach Theoretical Computer Science | 2015-05-18 | Paper |
| Polynomial time certifying algorithms for the planar quantified integer programming problem Journal of Logic and Computation | 2013-11-21 | Paper |
| A bialgebraic approach to automata and formal language theory Annals of Pure and Applied Logic | 2012-04-10 | Paper |
| A new algorithm for linear and integer feasibility in Horn constraints Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
| A Bialgebraic Approach to Automata and Formal Language Theory Logical Foundations of Computer Science | 2009-02-24 | Paper |
| Automatic Proof Generation in Kleene Algebra Relations and Kleene Algebra in Computer Science | 2008-05-15 | Paper |
| Feasibly Reducing KAT Equations to KA Equations | 2008-01-15 | Paper |
| GRAPH PRODUCTS AND CANNON PAIRS International Journal of Algebra and Computation | 2004-08-06 | Paper |
Research outcomes over time
This page was built for person: J. Worthington
