BCTCS 2018 : Day 3, Terminus!

Editor’s note: This is the second in a series of blog reports by my PhD student Gary Bennett who attended the annual British Colloquium for Theoretical Computer Science (BCTCS) 2018  at Royal Holloway University of London. Apparently, he really enjoyed himself!

On the third and final day of BTCS I was able to relax as I had already given my talk.

One of the talks that was particularly interesting was on Concurrent Kleene Algebra, aimed at incorporating concurrent composition. The talk showed how the toolkit for Kleene Algebra had been extended and what problems they had to overcome such as recursive forking.

In the afternoon there was a series of talks on stable matching. Stable matching is being used to find adoptive families for children in need of loving and permanent homes, and closer home for student projects allocation. Provided these matching instances are small enough they can be solved directly. However, for large instances the problem is intractable. In the talks given a number of approximation methods were presented to give high quality solutions in less time.

This marks the end of my journey at BCTCS. I have had a great time and met many great researchers!

Now it is time for me to relax over the Easter break in Hong Kong!

Gary

Advertisements

COSHER: journal paper published

TCS-Front

The final version of the paper Compact Routing Messages in Self-Healing Trees has now been published in the journal Theoretical Computer Science. The paper is now available at the following link: https://authors.elsevier.com/a/1WFCI15DaHr7c2 till February 07, 2018 without any registration or fees 🙂 (Thanks, Elsevier!).

A week in Bergen!

…to try to fix a marriage between distributed computing and parametrised complexity!

UIBInformatics
uib Høyteknologisenteret: Unfortunately it is not at all as sunny in the picture (rain, rain everywhere!) 😉

 

This is ‘working day’ 2 of my week in Bergen! I was delighted to be invited by the incredible Saket Saurabh to visit their world leading research department. The aim of this week is for me to give a series of lectures (one per day (1.5 hrs)! – I am hoping that my new postdoc Jonas Lefevre will take one for me 😉 on distributed computing with the aim to find intersections and possible  influences between distributed algorithms and parametrized complexity. I hope I have only a fraction of the energy that Saket has in managing his 12+ PhD students and postdocs 🙂

It’s exciting being here and looking forward to a really productive week!

 

 

 

My report on BCTCS 2016

My report on BCTCS 2016 held in Belfast from March 22nd to 24th at Belfast (QUB) is available at the bulletin of EATCS.

The 32nd British Colloquium of Theoretical Computer Science was held at Queen’s University Belfast from March 22nd to 24th, 2016. Here is my earlier blog post on the event.

I just noticed that my official report on the event was publised in the  June  issue of BEATCS (Bulletin of the European Association for Theoretical Computer Science). Here is the report (click the PDF link on the page).

Here are some nice mug shots of the crazies 🙂 involved in BCTCS : Organising Committee

If you get the clues from the previous page: On to University of St. Andrews in 2017, and Royal Holloway University of London in 2018!