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!