Research Online
Goldsmiths - University of London
Login
Menu
Home
About
Browse
Search
Advanced Search
Help
Deposit Guide
Latest Additions
Policies
Open Access
Funder Open Access Policies
Accessibility
Statistics
Contact
Items Authored/Edited by
Hierons, R.
Up a level
Export as
ASCII Citation
BibTeX
Dublin Core
Dublin Core
EP3 XML
EndNote
HTML Citation
JSON
METS
Multiline CSV
Object IDs
OpenURL ContextObject
RDF+N-Triples
RDF+N3
RDF+XML
Refer
Reference Manager
Atom
RSS
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 Aug 16 03:15:53 2024 BST
.