The British Colloquium for Theoretical Computer Science (BCTCS) is an annual event for UK-based researchers in theoretical computer science. A central aspect of BCTCS is the training of PhD students, providing an environment for students to gain experience in presenting their work, to broaden their outlook on the subject, and to 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.
BCTCS 2019 is the 35th conference in the series and is being held together with a workshop organized by AlgoUK, a network for the UK's algorithms and complexity research community.
INVITED BCTCS AND ALGOUK SPEAKERS
The detailed programme will appear here later. It will included contributed talks from participants on any topic in the scope of the colloquium. Instructions on how to submit an abstract are below. The goal is discussion, networking, and feedback.
There will also be a number of invited talks.
- BCTCS Invited Speakers
Maria Chudnovsky (Princeton)
Philip Wadler (Edinburgh)
- 15 April 2019. AlgoUK: Non-Standard Computing
Andrew Adamatzky (UWE)
Richard Jozsa (Cambridge)
Vivien Kendon (Durham)
Susan Stepney (York)
- 16 April 2019. AlgoUK: Algorithmics
Kitty Meeks (Glasgow)
Bahar Rastegari (Southampton)
Bernhard von Stengel (LSE)
James Worrell (Oxford)