Liverpool Algorithms Day


18 June 1999

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

Program of LAD99

Friday, 18th of June


10.00 - tea/coffee, juice, sandwiches and biscuits

10.55 - official opening (Leszek Gasieniec)

11.00 - morning session (chair: Alan Gibbons)

11.00-11.20 Deterministic broadcasting in unknown radio networks
Andrzej Pelc, Quebec University, Canada.

11.20-11.40 Learning Fixed-dimension Linear Thresholds From Fragmented Data
Paul Goldberg, Warwick University, UK.

11.40-12.00 On the Glauber dynamics for graph colourings
Catherine Greenhill, Leeds University, UK.

12.30 - lunch (Everyman)

13.30 - business meeting

14.00 - afternoon session (chair: Paul Dunne)

14.00-14.20 The Suffix Binary Search Tree
Rob Irving, Glasgow University, UK.

14.20-14.40 Algorithms for Computing Approximate Repetitions in Musical Sequences
Jose Pinzon, King's College London, UK.

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

14.50-15.10 The Shortest Path Approach to Optimal Prefix-Free Codes for Unequal Letter Costs
Wojciech Rytter, University of Liverpool, UK.

15.10-15.30 All pairs shortest paths using fast matrix multiplication
Uri Zwick, Tel Aviv University, Israel.

15.30 - tea/coffee, juice, sandwiches and biscuits

16.00 - late afternoon session (chair: Wojciech Rytter)

16.00-16.20 Stable marriage with ties and unacceptable partners
David Manlove, Glasgow University, UK.

16.20-16.40 Experiments with 1-D string matching algorithms
Thomas Berry, John Moores University, Liverpool, UK.

16.40-16.50 -- short break (10 minutes) --

16.50-17.10 Approximate rectangular tiling of multi-dimensional arrays
Jonathan Sharp, University of Warwick, UK.

17.10-17.30 Performing Independent Tasks on Processors Prone to Failures
Bogdan S. Chlebus, Uniwersytet Warszawski, Warsaw, Poland.

17.30 - closing (Leszek) and farewell tea/coffee