Liverpool Algorithms Day


30 May 2003

Department of Computer Science
University of Liverpool, Liverpool, UK
(Small Physics Theatre)

Program of LAD'03

Friday, 30th of May

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

10.25 - official opening

10.30 - morning session (chair: Leszek Gasieniec)

10.30-10.55 Complexity in Contract Negotiation
Paul E. Dunne, University of Liverpool, UK

10.55-11.20 ICT Programme Update: Opportunities and Trends
Andrew Bebb, EPSRC, UK.

11.20-11.40 -- tea/coffee break (20 minutes) --

11.40-12.25 Adaptive vs. Non-adaptive Algorithms in Group Testing (Invited Talk)
Annalisa De Bonis, University of Salerno, Italy

12.30 - lunch (Everyman)

14.00 - afternoon session I (chair: Michele Zito)

14.00-14.25 Collective Reading from Shared Memory
Bogdan S. Chlebus, University of Colorado, Denver, USA.

14.25-14.50 Proportionate fair processor scheduling:
worst-case analysis of a simple scheme
Mike Paterson, University of Warwick, UK.

14.50-15.00 -- short break (10 minutes) --

15.00-15.25 Greedy Matchings
Rob Irving, University of Glasgow, UK.

15.25-15.50 Approximate Counting by Dynamic Programming
Martin Dyer, University of Leeds, UK.

15.50-16.10 -- tea/coffee break (20 minutes) --

16.10 - afternoon session II (chair: Igor Potapov)

16.10-16.35 Utilitarian Link Assignment
Russell Martin, University of Warwick, UK.

16.35-17.00 Colouring Pairs of Binary Trees: Results and Problems
Paul Sant, Kings College London, UK.

17.00 - conclusion, pizza, farewell drinks, ...