University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Browse by Publication

Up a level
Export as [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 3.

Bruin, Henk and Volkova, Oksana (2005) The complexity of fibonacci-like kneading sequences Theoretical Computer Science. pp. 379-389.

Davies, J and Schneider, S (1995) A Brief History of Timed CSP. Theoretical Computer Science, 138 (2). pp. 243-271.

Mislove, MW, Roscoe, AW and Schneider, SA (1995) Fixed points without Completeness Theoretical Computer Science, 138. pp. 273-314.

This list was generated on Fri May 26 09:26:13 2017 UTC.

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800