Jan 28th, 2019 was a historic day at Loughborough University – well, at least, for distributed algorithms, since the first Distributed Algorithms @ Loughborough workshop was held there. Even though I am biased as the organiser, my feeling is that the day went well and the attendees enjoyed the workshop and all that was on offer – the high quality talks, the hospitality at Burleigh court – the large lunch and dinner, the drinks and even the foosball!
Somebody at Burleigh court kept trying hard to convince us (by putting up signposts) that our workshop was on Distribution Algorithms (rather than on Distributed Algorithms) but still the speakers pushed on with the high quality talks on distributed algorithms, the slides and abstracts of which are now available on the conference site www.cosher.org/dal or linked right below (in order of presentation). Many thanks again to all the attendees and to EPSRC for making this possible.
- Posco Tso. The Federated RaspberryPi µ-Infrastructure Testbed
- Artur Czumaj. Round Compression for Parallel Approximate Matching Algorithms
- Paul Spirakis. Models for Programmable Matter
- Shay Kutten. Brief history of local checkability: from self stabilization to complexity theory
- Ian Phillips. How to break the Internet in new and interesting ways
- Michael Elkin. Distributed Routing
- Amitabh Trehan. COSHER: Self-Healing Compact Routing and other problems in low memory
- Thomas Sauerwald. On coalescence time in graphs — When is coalescing as fast as meeting?
- M L Daggitt. An algebraic approach to routing