Bristol Algorithms Days
BAD '09
11-12 May 2009
Department of Computer Science
University of Bristol, Bristol, UK
 |
 |
 |
|
General Information
Registration
Participation
Topics
Speakers and Slides
Schedule and Abstracts
Venue
Organising Committee
Travel
Other information
General Information
The third annual Bristol Algorithms Days (BAD'09) was held at the Department of Computer Science, University of Bristol, in Bristol, 11-12 May 2009. The aim of BAD'09 was to gather researchers and students interested in the study of theoretical and practical aspects of algorithms. Information about BAD'08 can be found here .
This workshop was funded by "Bridging the Gaps", an EPSRC-funded initiatiave to set up an environment that nurtures interdisciplinary working, with the aim of developing new collaborative research programmes at the interface between mathematical sciences, information and computing technology and engineering.
Feedback
We would be grateful for any feedback you have about BAD'09. A feedback form was included in the registration pack for the event, or can be downloaded in either Microsoft Word (.doc) format or in PDF format.
Registration
Registration for BAD'09 has now closed.Participation
The following is the final list of participants for BAD'09 :-
|
|
|
Topics
In the spirit of the workshop we invite participants to present work and ideas in many areas of algorithmics including the following.
- Combinatorial Pattern Matching
- Complexity Theory
- Approximation Algorithms
- Randomised Algorithms
- Graph Theory
- Probabilistic Analysis
- Game Theory
- Quantum Computing
Speakers and Slides
The following speakers gave talks at BAD'09:Links to the associated slides are given where available.
- Artur Czumaj (University of Warwick)
Testing continuous distributions - Alexander Tiskin (University of Warwick)
Fast distance multiplication of unit Monge matrices - Kostas Tsichlas (University of Patras)
Deterministic structures over P2P networks - Harald Raecke (University of Warwick)
Oblivious interference scheduling - Andy Twigg (University of Oxford)
Data locality problems and coloured bin packing - Iain Stewart (Durham University)
The one-to-many node-disjoint paths problem in certain interconnection networks - Alan Gibbons (Kings College London) & Martyn Amos (Manchester Metropolitan University)
Biological perspectives on filamental automata
See also two associated videos: single (WMV) and multiple (WMV) - Sharon Curtis (Oxford Brookes University)
Densities and partitions - Pim van 't Hof (Durham University)
Finding induced paths of given parity in claw free graphs - James Cruise (University of Bristol)
Ranking and suggesting popular items - Leszek Gasieniec (University of Liverpool)
Efficient rumour spreading (gossiping) methods in wireless/radio networks - Ida Pu (University of London)
Expanding ring search algorithms and their energy time efficiency - Stanislav Zivny (University of Oxford)
The expressive power of binary submodular functions - Andrew Potter (University of Bristol)
Computing the factors of the Ith cyclotomic polynomial over Fp - Raphaël Clifford (University of Bristol)
Pattern matching with few errors and wildcard symbols
A note on matrix multiplication and pattern matching under the Hamming norm - David Manlove (University of Glasgow)
Optimising paired and pooled kidney exchanges - Péter Biró (University of Glasgow)
New stable marriage problems arising from national matching schemes in Hungary - James Gate (Durham University)
Descriptive complexity of optimisation problems
Schedule
- Schedule for online use (HTML)
- Schedule for offline use (PDF)
- The abstract booklet is also available (PDF)
Venue
| The workshop took place at the Avon Gorge Hotel |
Organising Committee
Travel
For travel to the University of Bristol follow these guides. Bristol International airport is about 20 minutes by bus/taxi from the University and has flights to most locations in Europe and also directly to New York. Alternatively, London Heathrow is under two hours away by direct bus or train via London.
Other information
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.