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 |
|---|
Complexity of data dependence problems for program schemas with concurrency
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Completeness results for omega-regular algebras
Journal of Logical and Algebraic Methods in Programming | 2015-06-10 | Paper |
Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
Relational and Algebraic Methods in Computer Science | 2014-04-16 | Paper |
On completeness of omega-regular algebras
Relational and Algebraic Methods in Computer Science | 2012-09-21 | Paper |
On the computational complexity of dynamic slicing problems for program schemas
Mathematical Structures in Computer Science | 2011-12-08 | Paper |
A unifying theory of control dependence and its application to arbitrary program structures
Theoretical Computer Science | 2011-12-07 | Paper |
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
The Journal of Logic and Algebraic Programming | 2011-12-02 | Paper |
Omega algebras and regular equations
Relational and Algebraic Methods in Computer Science | 2011-06-17 | Paper |
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
The Journal of Logic and Algebraic Programming | 2011-02-09 | Paper |
The complexity of contract negotiation
Artificial Intelligence | 2007-10-23 | Paper |
Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas
The Journal of Logic and Algebraic Programming | 2007-08-10 | Paper |
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
Theoretical Computer Science | 2007-04-13 | Paper |
Equivalence of conservative, free, linear program schemas is decidable
Theoretical Computer Science | 2003-01-21 | Paper |
A Generating Set for the Automorphism Group of a Graph Group
Journal of the London Mathematical Society | 1996-04-16 | Paper |
Research outcomes over time
This page was built for person: Michael R. Laurence
