Available identifiers
zbMath Open laurence.michael-rMaRDI QIDQ624385
List of research outcomes
| Publication | Date of Publication | Type |
|---|
| Complexity of Data Dependence Problems for Program Schemas with Concurrency | 2015-09-17 | Paper |
| Completeness results for omega-regular algebras | 2015-06-10 | Paper |
| Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages | 2014-04-16 | Paper |
| On Completeness of Omega-Regular Algebras | 2012-09-21 | Paper |
| On the computational complexity of dynamic slicing problems for program schemas | 2011-12-08 | Paper |
| A unifying theory of control dependence and its application to arbitrary program structures | 2011-12-07 | Paper |
| Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas | 2011-12-02 | Paper |
| Omega Algebras and Regular Equations | 2011-06-17 | Paper |
| Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas | 2011-02-09 | Paper |
| The complexity of contract negotiation | 2007-10-23 | Paper |
| Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas | 2007-08-10 | Paper |
| Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time | 2007-04-13 | Paper |
| Equivalence of conservative, free, linear program schemas is decidable | 2003-01-21 | Paper |
| A Generating Set for the Automorphism Group of a Graph Group | 1996-04-16 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Michael R. Laurence
