Personal tools
You are here: Home

Did you not find what you were looking for? Try the Advanced Search to refine your search.

Search results 499 items matching your search terms

Subscribe to an always-updated feed of these search terms

Page Approximating the permanent
Eric Vigoda University of Edinburgh 4pm, Friday 23 February 2001 Room 2511, JCMB, King's Buildings
Page A lower bound for the mixing time of a class of Markov chains
Martin Dyer University of Leeds 4pm, Tuesday 20 February 2001 Room 2511, JCMB, King's Buildings
Page Computing Symbolic Models for Verifying Cryptographic Protocols
Marcelo Fiore Cambridge Computing Laboratory 4pm, Thursday 15 February 2001 Room 2511, JCMB, King's Buildings
Page On Compositional method and its limitations
Alexander Rabinovich Tel Aviv University 4pm, Tuesday 23 January 2001 Room 2511, JCMB, King's Buildings
Folder 1996
Collection Seminar Archives
Collection 2005
Collection 1996
Collection 1997
Collection 1998
Collection 1999
Collection 2000
Collection 2001
Collection 2002
Collection 2003
Collection 2004
Collection 2006-2007
Collection 2007-2008
Page Dependent Types and Algebraic Effects
Page Product-form Solutions
Event LFCS End-of-Year Quiz
Page A Rule-Based Formalism for Contact + Locality in Computational Systems Biology
The project is to investigate stochastic rule-based formalisms for computational systems biology that allow multilevel cellular systems that permit bonding at ...
File A Rule-Based Formalism for Contact + Locality in Computational Systems Biology
Page Decision procedures for infinite state systems
The aim is to extend techniques of model checking and equivalence checking from finite to infinite state systems.
Page Quantum Complexity
Page Quantum Cryptography
Page Collective Dynamics from Stochastic Process Algebras
Precise interaction of individuals coupled with analysis of the dynamic behaviour at the level of populations.
Page Quantitative Modelling with Process Algebras
Stochastic process algebras, providing high-level descriptions of dynamic systems, amenable to rigorous mathematical analysis through formal semantics.
Page Topics in Pseudorandomness and Circuit Lower Bounds
This topic is suitable for a student with interests in cryptography or complexity theory.
Page Testing model transformations
Develop some aspect of the theory of testing model transformations.