Liverpool Algorithms Day
LAD'03
30 May 2003
Department of Computer Science
University of Liverpool, Liverpool, UK
List of Talks and Speakers
-
Collective Reading from Shared Memory
Bogdan S. Chlebus, University of Colorado, Denver, USA
-
Algorithmics and Combinatorics of Group Testing
Annalisa De Bonis, University of Salerno, Salerno, Italy
-
Complexity in Contract Negotiation
Paul E. Dunne, University of Liverpool, Liverpool, UK
-
Approximate Counting by Dynamic Programming
Martin E. Dyer, University of Leeds, Liverpool, UK
-
Greedy Matchings
Rob Irving, University of Glasgow, Glasgow, UK
-
Utilitarian Link Assignment
Russell Martin, University of Warwick, Coventry, UK
-
Proportionate fair processor scheduling:
worst-case analysis of a simple scheme
Mike Paterson, University of Warwick, Coventry, UK
-
Colouring Pairs of Binary Trees: Results and Problems
Paul Sant, King's College, London, UK
If you intend to give a presentation at LAD'03 please send
its title and short absract to
leszek@csc.liv.ac.uk.