BCTCS 2010

26th British Colloquium for Theoretical Computer Science

6-9 April 2010

  University of Edinburgh

The 25th anniversary (26th meeting) of British Colloquium for Theoretical Computer Science is hosted by the School of Informatics, University of Edinburgh.

The purpose of BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers.


The scope of the colloquium includes all aspects of theoretical computer science, including automata theory, algorithms, complexity theory, semantics, formal methods, concurrency, types, languages and logics. Both computer scientists and mathematicians are welcome to attend, as are participants from outside of the UK.

Invited Speakers

The following will deliver invited lectures:
  • Erik Demaine (MIT)
    Algorithms Meet Art, Puzzles, and Magic
  • Johan Håstad (KTH Stockholm)
    Approximation Resistance
  • Gil Kalai (HU Jerusalem - LMS keynote speaker in discrete mathematics)
    Analysis and Probability of Boolean Functions
  • Kim Guldstrand Larsen (Aalborg)
    Verifying LEGO: Validation and Synthesis of Embedded Software
  • Catuscia Palamidessi (INRIA / École Polytechnique)
    Information-Theoretic approaches to Information Flow
  • Ulrike Sattler (Manchester)
    Automated Reasoning for Ontology Engineering


Julian Bradfield, Mary Cryan
together with Bahareh Afshari, Julian Gutiérrez, Magdalena Mazurczak, Grant Passmore.


All enquiries should be made to bctcs2010 (at) inf.ed.ac.uk.


Engineering and Physical Sciences Research CouncilLondon Mathematical Society