BAD'16 Poster

Bristol Algorithms Days 2016
Workshop on Efficient Algorithms and Lower Bounds

2 - 3 February 2016


  •    •    •  

Programme

Workshop venue: The workshop venue is the Avon Gorge Hotel, Sion Hill, Clifton, Bristol, BS8 4LD (red point on the map).

Workshop dinner: The workshop dinner will take place at 19:15 at the Lido, Oakfield Place, Clifton, Bristol BS8 2BJ (green point on the map).


Tuesday 2nd February 2016


11.00-11.30

Welcome coffee

11.30-12.15

Some mathematical aspects of data centre networks

Iain Stewart (slides)

12.15-13.00

Efficient search and monitoring protocols for mobile entities

Leszek Gąsieniec (slides)

13.00-14.00

Lunch

14.00-15.30

Excursion

15.30-16.15

Self-organizing binary search trees: Recent results

Kurt Mehlhorn (slides) 

16.15-16.45

Coffee break

16.45-17.30

Algorithms and barriers for random hypergraph partitioning

Will Perkins (slides)

17.30-18.15

Learning with submodular functions: Models, algorithms, and applications

Alina Ene

19.15-

Workshop dinner at Lido



Wednesday 3rd February 2016


09.00-09.15

Morning coffee

09.15-10.00

Approximate Nash equilibrium computation

Paul Goldberg (slides)

10.00-10.45

Conditional lower bounds for dynamic programming problems

Karl Bringmann (slides)

10.45-11.15

Coffee Break

11.15-12.00

Quantum algorithms and machine learning

Iordanis Kerenidis (slides) 

12.00-12.45

Vacant sets and vacant nets: Critical times simple and modified random walks

Colin Cooper (slides) 

12.45-14.30

Lunch

14.30-15.15

Unconditional hardness results for dynamic and online problems

Allan Grønlund (slides)

15.15-16.00

Multiple random walks

Thomas Sauerwald (slides)



  The University of Bristol   EPSRC