Items Authored/Edited by Harman, M.

Group by: Item Type | Date | No Grouping

Number of items: 2.

Danicic, Sebastian; Harman, M.; Hierons, R. and Laurence, M.. 2007. Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. Theoretical Computer Science, 373(1-2), pp. 1-18. ISSN 03043975 [Article]

Danicic, Sebastian; Laurence, M.; Harman, M. and Hierons, R.. 2003. Equivalence of conservative, free, linear programs is decidable. Theoretical Computer Science, 290(1), pp. 831-862. ISSN 03043975 [Article]

This list was generated on Fri Nov 22 03:41:32 2024 GMT.

Export as	Atom RSS