Liverpool Algorithms Day
18 June 1999
Department of Computer Science
University of Liverpool, Liverpool, UK
If you intend to give a presentation at LAD'99 please send
its title and short absract to
Experiments with 1-D string matching algorithms
Thomas Berry , John Moores University, Liverpool, UK.
Performing Independent Tasks on Processors Prone to Failures
Bogdan S. Chlebus , Uniwersytet Warszawski,
- Learning Fixed-dimension Linear
Thresholds From Fragmented Data
Paul Goldberg , Warwick University, UK.
On the Glauber dynamics for graph colourings
Catherine Greenhill , Leeds University, UK.
The Suffix Binary Search Tree
Rob Irving , Glasgow University, UK.
Stable marriage with ties and unacceptable partners
David Manlove , Glasgow University, UK.
Deterministic broadcasting in unknown radio networks
Andrzej Pelc , University of Quebec at Hull, Canada.
Algorithms for Computing Approximate
Repetitions in Musical Sequences
Jose Pinzon , King's College London, UK.
The Shortest Path Approach to Optimal Prefix-Free
Codes for Unequal Letter Costs
Wojciech Rytter , University of Liverpool, UK.
Approximate rectangular tiling of multi-dimensional arrays
Jonathan Sharp , University of Warwick, UK.
All pairs shortest paths using fast matrix multiplication
Uri Zwick , Tel Aviv University, Israel.