BristolArchive - Edinburgh Computer History

This is G o o g l e's cache of http://history.dcs.ed.ac.uk/history/BristolArchive as retrieved on 4 Jul 2006 06:00:42 GMT.
G o o g l e's cache is the snapshot that we took of the page as we crawled the web.
The page may have changed since that time. Click here for the current page without highlighting.
This cached page may reference images which are no longer available. Click here for the cached text only.
To link to or bookmark this page, use the following url: http://www.google.com/search?q=cache:YBvlcwkjyiIJ:history.dcs.ed.ac.uk

Google is neither affiliated with the authors of this page nor responsible for its content.

BristolArchive

UserPreferences

Edinburgh Computer History

FrontPage

RecentChanges

TitleIndex

WordIndex

SiteNavigation

HelpContents

moin.sf.net

David May at Bristol has copies of the following:

CSR-5-77: Milner: flowgraphs and flow algebras
CSR-9-77: Milner: A theory of type polymorphism in programming
CSR-11-77: (parts 1 and 2) Gordon, Milner, Wadsworth: Edinburgh LCF, Appendices and Index
CSR-13-77: Valiant: Graph theoretic arguments in low-level complexity
CSR-14-77: Valiant: The complexity of computing the permanent
CSR-15-77: Valiant: The complexity of enumeration and reliability problems
CSR-16-77: Gordon, Milner, Morris, Newey, Wadsworth: A metalanguage for interactive proof in LCF
CSR-17-77: Angluin and Valiant - Fast probabilistic algorithms for Hamiltonian circuits and \matchings
CSR-39-79: Valiant - Negation can be exponentially powerful
CSR-44-79: Barton and Buchanan: The polygon package
CSR-48-79: Buchanan and Gray: Models for structured integrated circuit design
CSR-54-80: Valiant - Universality considerations in VLSI circuits
CSR-63-80: Valiant - Lev, Pippinger, Valiant: A fast parallel algorithm for routing in permutation networks
CSR-73-80: Valiant - Experiments with a parallel communication scheme
CSR-82-81: Milner - A finite delay operator in synchronous CCS
CSR-95-81: Lev and Valiant - Size bounds for superconcentrators
CSR-104-82: Gordon - A model of register transfer systems with applications to microcode and VLSI correctness
CSR-114-82: Plotkin - An operational semantics for CSP
CSR-116-82: Milner - Calculi for Synchrony and Asynchrony
CSR-157-83: Milner - A proposal for standard ML