BCTCS 2015

Shard1The 31st British Colloquium of Theoretical Computer Science (BCTCS) was held at Middlesex University London, 14th–16th and 18th September 2015. The organisers were Barnaby Martin, Giuseppe Primiero and Rajagopal Nagarajan.

The list of keynote/invited speakers included Tony Hoare, Per Martin-Löf, Samson Abramsky, Thomas Hales (LMS Keynote Speaker in Discrete Mathematics), Timothy GowersJoseph Sifakis and Andrei Krokhin. In addition to student talks, there were a few talks from other experienced researchers. The speakers included Ross Duncan, Andrew Lewis-Pye, Paulo Oliva and Aris Pagourtzis. 


The programme is available here.

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.

This meeting is associated with the LMS 150th Anniversary Computer Science Colloquium to be held on 17th September 2015 at the Royal Society.


The registration fee for the whole conference is £140, which includes lunches/coffee/tea on all four days and drinks reception on Tuesday and Wednesday. This does not include the conference dinner on Monday, which costs £40. You can also register for one or more days of the conference at a day rate of £45. You can register here. Please contact barnabymartin @ gmail.com if you have any problems.

Social Events

The conference dinner will be on Monday the 14th at the Strada Restaurant, 2 More London Place, The Riverside, London SE1 2JP. The venue boasts a spectacular view of London and the Thames river. There will be a drinks reception at the Grove Building, Middlesex University on Tuesday the 15th, and another at Portcullis House, an annex of the Palace of Westminster, on Wednesday the 16th.

Bursaries for PhD students

We are grateful for support from the Heilbronn Institute for Mathematical Research which will provide bursaries for 18 PhD students. These are intended primarily for those studying in the UK and without other sources of funding.  The bursaries cover registration fees and accommodation (but not travel). Most bursaries have now been allocated. But if you need a bursary, please email g.primiero @ mdx.ac.uk as soon as possible requesting funding, indicating that you would be willing to give a contributed talk and stating the name of your supervisor. Subsequently, a title and abstract should be provided. Students can register for free here, but this is subject to approval by the organisers.


We have reserved a number of rooms at Hendon Hall Hotel at £110 per
night (please contact barnabymartin@gmail.com). However, there is the
possibility to stay at many hotels within a short tube or bus journey and these
rooms are cheaper when booked by individuals through sites such as hotels.com, lastminute.com and booking.com.

Conference Venue and Directions

The talks will take place in Committee Room 3, Hendon Town Hall, The Burroughs, Hendon, London NW4 4BT. The Hendon Campus is about a 10 minute walk (mostly uphill) from Hendon Central, which is 30 minutes from Central London on the tube (Northern Line, Edgware Branch). It is also well connected by buses and Thameslink, and is close to the southern end of the M1. Parking is scarce around the campus but there is free parking west of A41 (a 10 minute walk ) after 11 a.m. More information about the campus and getting to the university can be found here. The Transport for London website may also be useful.


We kindly thank the Heilbronn Institute for Mathematical Research, the London Mathematical Society and EPSRC for their sponsorship of BCTCS’15.