The 32nd British Colloquium of Theoretical Computer Science (BCTCS 2016) was held in Belfast from March 22nd to 24th at the pictueresque setting of Queen’s University Belfast and the newly remodelled Graduate School. It was a good amount of work – a bit like a 200 mts race where you accelerate rapidly and take a while to stop! This was more so because my colleague Alan Stewart who brought the conference here promptly retired leaving me in-charge! (Though he still did much of the work even post-retirement 🙂
I did my PhD in the USA in the area of algorithms and I discover that the areas of focus in theoretical Computer Science differ markedly in the US and UK. The UK has traditional strength in Languages and Logic whereas in the US there seems to be more strength in Algorithms based theory (this is something that the EPSRC readily admit!). BCTCS had good representation across the themes particularly since some of our speakers were from across the pond(s) (including Iceland!).
Slides from some of the talks are available at http://www.amitabhtrehan.net/bctcs.html
- Michael Butler: Verification patterns for Refinement
- Bhaskar DasGupta: Node Expansions and Cuts in Gromov-hyperbolic Graphs
- Colm Dunlaing: An almost-confluent congruential language which is not a Church-Rosser language
- Gregory Chockler: Space Bounds for Reliable Storage: Fundamental Limits of Coding
- Magnus Halldorson: “What problem should I solve?“ or Efficiency in Wireless Networks?
- Bruce Kapron: Gambling, Computational Information and Encryption Security
Hope you have a look and find them interesting!