Monday 11rd May 2009
Riverside Room, Avon Gorge Hotel
|
8.30-9.00 |
Coffee and registration |
|
Session I |
|
|
|
9.00-9.15 |
Welcome and introduction |
Raphaël Clifford |
|
9.15-10.00 |
Testing continuous distributions |
Artur Czumaj |
|
10.00-10.25 |
Fast distance multiplication of unit Monge Matrices |
Alexander Tiskin |
|
10.25-10.50 |
Deterministic Structures over P2P Networks |
Kostas Tsichlas |
|
10.50-11.20 |
Coffee break |
|
|
11.20-12.05 |
Oblivious interference scheduling |
Harald Raecke |
|
12.05-12.30 |
Data locality problems and coloured bin packing |
Andy Twigg |
|
12.30-2.30 |
Lunch |
|
Session II |
|
|
|
2.30-3.15 |
The one-to-many node-disjoint paths problem in certain interconnection networks |
Iain Stewart |
|
3.15-3.40 |
Biological perspectives on filamental automata |
Alan Gibbons & Martyn Amos |
|
3.40-4.05 |
Densities and partitions |
Sharon Curtis |
|
4.05-4.35 |
Coffee break |
|
|
4.35-5.00 |
Finding induced paths of given parity in claw free graphs |
Pim van 't Hof |
|
5.00-5.25 |
Ranking and suggesting popular items |
James Cruise |
Session III |
|
|
|
5.30-6.30 |
Breakout session |
|
Workshop dinner
The workshop dinner will take place at The Mansion House, Clifton Down, Bristol, BS8 3LJ at 19.00.
Tuesday 12th May 2009
Riverside Room, Avon Gorge Hotel
|
8.30-9.00 |
Coffee |
|
Session IV |
|
|
|
9.00-9.45 |
Efficient rumour spreading (gossiping) methods in wireless/radio networks |
Leszek Gasieniec |
|
9.45-10.10 |
Expanding ring search algorithms and their energy time efficiency |
Ida Pu |
|
10.10-10.35 |
The expressive power of binary submodular functions |
Stanislav Zivny |
|
10.35-11.05 |
Coffee |
|
|
11.05-11.50 |
Computing the factors of the Ith cyclotomic polynomial over Fp |
Andrew Potter |
|
11.50-12.15 |
Pattern matching with few errors and wildcard symbols |
Raphaël Clifford |
|
12.15-1.45 |
Lunch |
|
Session V |
|
|
|
1.45-2.30 |
Optimising paired and pooled kidney exchanges |
David Manlove |
|
2.30-2.55 |
New stable marriage problems arising from national matching schemes in Hungary |
Péter Biró |
|
2.55-3.20 |
Descriptive complexity of optimisation problems |
James Gate |
Session VI |
|
|
|
3.20-4.20 |
Breakout session |
|
Close |
|
|