Liverpool Algorithms Day


23 May, 2008

Department of Computer Science
University of Liverpool
(Ashton Building Lecture Theatre)

Program of LAD'08

Friday, 23 May, 2008

10.00 - tea/coffee, juice, water, biscuits, ...

10.25 - official opening

10.30 - morning session (chair: Leszek Gąsieniec)

10.30-11.00 Getting from one colouring to another
Jan van den Heuvel, London School of Economics and Political Science, UK

11.00-11.30 Fast Lempel-Ziv factorisation and consequences
Maxime Crochemore, King's College London, UK & Universite Paris-Est.

11.30-12.00 Testing Graph Properties
Artur Czumaj, University of Warwick, UK.

12.00 - lunch (Everyman)

14.00 - afternoon session I (chair: Darek Kowalski)

14.00-14.30 Tolerating Faults in Distributed-memory Multiprocessors
Iain Stewart, University of Durham, UK.

14.30-15.00 Size versus stability in the marriage problem
David Manlove, Glasgow University, UK.

15.00-15.30 -- tea/coffee break --

15.30 - afternoon session II - Inaugural Lecture (chair: Stephen Holloway)

15.30-16.30 Exploring computational complexity through graph homomorphisms
Leslie Goldberg, University of Liverpool, UK.

16.45 - afternoon session III (chair: Russell Martin)

16.45-17.15 An Approximation Trichotomy for Boolean #CSP
Mark Jerrum, Queen Mary University of London, UK.

17.15-17.45 The Complexity of Weighted Boolean #CSP
Martin Dyer, University of Leeds, UK.

17.45 - Inaugural Lecture reception, farewell drinks, ... [Room G.12]

Contact: This page was last updated on the 23rd April 08.