The School of Mathematical Sciences is organising the Queen Mary Algorithms Day (QMAD) on Wednesday 20 February 2013. QMAD will follow the successful formula of previous Algorithms Days held at Liverpool and Warwick.
The meeting will start at 10:30 (with coffee available from 10:00), so that many potential participants will be able to attend as a day-trip. All the events will take place in the Mathematics Building on the Mile End Campus, and the meeting will close around 17:15.
Speakers on the day will include:
- Peter Cameron, QMUL, Algorithmic aspects of synchronization
- Anuj Dawar, Cambridge, On Tractable approximations of Graph Isomorphism
- Leslie Goldberg, Liverpool, Approximating Counting Constraint Satisfaction Problems
- Georg Gottlob, Oxford, Robust constraint satisfaction and hidden variable detection in quantum mechanics
- Andrei Krokhin, Durham, Robust approximability of constraint satisfaction problems
- Rahul Santhanam, Edinburgh, QBF Satisfiability algorithms and circuit lower bounds
- John Talbot, UCL, Flag algebra computations in extremal combinatorics