Embedded Files
Algorithms & Complexity
University of Warwick
The Workshop Algorithms & Complexity @ Warwick will be held on 22-23 September at the University of Warwick.
The aim of the event is to highlight several recent exciting advances in the field of Algorithms and Complexity and to facilitate interactions within the research community in the UK.
Invited Speakers
Invited Speakers
Technical University of Catalonia
University of Bath
University of Pennsylvania
Max Planck Institute for Informatics
Charles University in Prague
University of Sheffield and University of Haifa
University of Oxford
University of Cambridge
University of Toronto
Venue
Venue
Zeeman Building (Mathematics) - Lecture Room MS.02
Zeeman Building (Mathematics) - Lecture Room MS.02
University of Warwick
University of Warwick
Schedule
Schedule
Monday, September 22 (Lecture Room MS.02)
10:00 - 10:55 Coffee
10:55 - 11:00 Opening Remarks
11:00 - 12:00 Tomasz Kociumaka - Bounded Edit Distance
12:00 - 14:00 Lunch (Radcliffe - Warwick Conferences)
14:45 - 15:30 Albert Atserias - Axiomatic Strength of Hitting Sets for Multivariate Polynomials, within Bounded Arithmetic
15:30 - 16:00 Coffee
16:00 - 16:45 Michal Koucky - Nearly Optimal List Labeling
16:45 - 17:30 Raheleh Jalali - AKS Primality Testing in Bounded Arithmetic
18:30 - 20:00 Dinner (Scarman - Warwick Conferences)
Tuesday, September 23 (Lecture Room MS.02)
09:30 - 10:15 Coffee
10:15 - 11:15 Sanjeev Khanna - Breaking the √n Round Barrier: New Parallel Algorithms for Finding a Matroid Basis
11:15 - 12:00 Roei Tell - Composing Low-Space Algorithms
12:00 - 14:00 Lunch (Radcliffe - Warwick Conferences)
14:00 - 14:45 Or Meir - The KRW Conjecture
14:45 - 15:30 Thomas Sauerwald - Balanced Allocations: The Power of Choice versus Noise
15:30 - 16:00 Coffee
16:00 - 16:45 Rahul Santhanam - How to Construct Random Strings
Page updated
Google Sites
Report abuse