More information will be added in the future to this page. Please check it regularly.
Liverpool Algorithms Day (LAD'99) will be held at the Department of Computer Science, University of Liverpool, in Liverpool, on 18 June, 1999. LAD'99 is the continuation of the meeting organised at King's College London in February 1999 and which was devoted to combinatorial aspects of string processing. The aim of LAD'99 is to gather researchers and students interested in study of theoretical and practical aspects of algorithms.
So far, we expect participants (academics and students) from UK sites
including: Leeds, Liverpool, London, Glasgow, and Warwick. Please feel
free to invite anybody that might be interested in.
We also expect overseas participants (more details later).
All the presentations will be allocated in 20 minutes slots (including
questions). There will be 3 sessions. One before and two after lunch.
Each session will be chaired.
The most likely sessions will start at 11 am and they should be finished before 5(6) pm.
Tentative program is available here.
Small Physics Theatre, Chadwick Bldg (42), check also the whole map of the University campus.
tel: (+44 151) 794 3686
fax: (+44 151) 794 3715
Department of Computer Science
University of Liverpool
L69 7ZF, Liverpool, UK
It is advised (but not obligatory) to inform organisers before attending the meeting. Thanks to the generous contribution of the Head of Department we should be able to avoid registration fees (cost of lunch and coffee breaks).
This is one day meeting with the assumption that most of the participants will come and leave on the same day. However we will help to arrange accommodation for all who want to stay longer in Liverpool. If you wish to do so please contact organisers as soon as possible.
If you are travelling to the University of Liverpool, the Travel Guide will show you how to get onto campus by whatever means of travel you choose.
We will try to make participants lives as easy as possible (email access, space for discussion, tea/coffee/cookie access, etc) Please do not hesitate with any questions/suggestions that you may have.