Coronavirus (Covid-19): Latest updates and information
Skip to main content Skip to navigation

Mike66: Programme

Thursday, September 18, 2008
 9:00 –  9:30 Registration. Warwick Mathematics Institute
Morning Session. Room MS.01
 9:30 –  9:45 Opening, Artur Czumaj / Mark Smith (Pro-Vice-Chancellor for Research)
 9:45 – 10:30 Leslie G. Valiant
Harvard
Evolvability
10:30 – 11:00 Michael J. Fischer
Yale
Analysis of Think-a-Dot
11:00 – 11:30 Coffee break
11:30 – 12:00 Maurice Nivat
LIAFA, Paris
About the birth of theoretical computer science
12:00 – 12:30 Paul E. Dunne
University of Liverpool
Computational complexity and algorithms in semantics of abstract argumentation frameworks
12:30 –  1:00 Graham Cormode
AT&T
On 'Selection and sorting with limited storage'
 1:00 –  2:45 Lunch break
 
Afternoon Session. Room MS.01
 3:00 –  3:30 J. Ian Munro
University of Waterloo
Succinct data structures: Techniques and lower bounds
 3:30 –  4:00 Vaughan Pratt
Stanford
Affine algebra: numbers from geometry
 4:00 –  4:30 Coffee break
 4:30 –  5:00 Martin E. Dyer
University of Leeds
A complexity dichotomy for hypergraph partition functions
 5:00 –  5:30 Mark Jerrum
Queen Mary London
An approximation trichotomy for Boolean #CSP
 5:30 –  6:00 Mike Paterson
University of Warwick
Mother's pie problem
 
Friday, September 19, 2008
Morning Session. Room MS.01
 9:30 –  9:45 Opening, Uri Zwick
 9:45 – 10:30 Donald E. Knuth
Stanford
The amazing Y functions
10:30 – 11:00 Kurt Mehlhorn
MPI Saarbrucken
Assigning papers to reviewers
11:00 – 11:30 Coffee break
11:30 – 12:00 S. Muthukrishnan
Google Research
String convolutions
12:00 – 12:30 Maxime Crochemore
King's College London
Faster than Mike? Not yet done!
12:30 –  1:00 Cenk S. Sahinalp
Simon Fraser University
How would you like to have your edit distance computed? Exactly or approximately?
 1:00 –  2:40 Lunch break
 
Afternoon Session. Room MS.01
 2:40 –  3:25 Richard M. Karp
UC Berkeley
Implicit set cover problems
 3:25 –  3:55 Josep Diaz
Universitat Politecnica de Catalunya
New bounds for the phase transition of 3SAT
 3:55 –  4:25 Coffee break
 4:25 –  4:55 Kazuo Iwama
Kyoto University
Big circuit reduction and network coding
 4:55 –  5:25 Faith Ellen
University of Toronto
Valency arguments
 5:25 –  5:40 Closing, Leslie Ann Goldberg