There will be a one-day meeting on algorithms at Queen Mary, University of London, on Wednesday 20 February 2013. QMAD will follow the successful low-overhead formula of previous Algorithms Days at Liverpool and Warwick: a “pop-up” meeting, if you like. We have talks from the following speakers:
- 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, Satisfiability algorithms
- John Talbot, UCL, Flag algebra computations in extremal combinatorics
The meeting starts 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 take place in the Mathematics Building on the Mile End Campus, and the meeting will close around 17:15. Directions to the Mathematics Building can be found here. A final programme is now available.
Please drop me a line using the form below, by 13th February, if you are coming to QMAD. This will allow me to update the mailing list, and also ensure that we don’t run out of food at lunchtime.