Embedded Files
Algorithms & Complexity
University of Warwick
The Workshop Algorithms & Complexity @ Warwick will be held on 23-24 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.
List of Speakers
List of Speakers
University of Cambridge
KTH Royal Institute of Technology
EPFL
INSAIT, Sofia University "St. Kliment Ohridski" & ETH Zurich
IT University of Copenhagen
National Institute of Informatics (Tokyo)
University of Oxford
MIT
Venue
Venue
Zeeman Building (Mathematics) - Lecture Rooms MS.04 & MS.05
Zeeman Building (Mathematics) - Lecture Rooms MS.04 & MS.05
University of Warwick
University of Warwick
Schedule
Schedule
Monday, September 23 (Lecture Room MS.05)
10:00 - 10:55 Coffee
10:55 - 11:00 Opening Remarks
11:00 - 12:00 Bernhard Haeupler - Graph Decompositions and Length-Constrained Expanders
12:15 - 13:30 Lunch (Scarman - Warwick Conferences)
14:00 - 14:45 Mika Göös - Constant-Cost Communication
14:45 - 15:30 Anuj Dawar - The Hardness of Approximation, Symmetrically
15:30 - 16:00 Coffee
16:00 - 16:45 Christian Konrad - Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
16:45 - 17:30 Ted Pyne - Studying Catalytic Space Via Compression
18:30 - 20:00 Dinner (Scarman - Warwick Conferences)
Tuesday, September 24 (Lecture Room MS.04)
09:30 - 10:30 Coffee
10:30 - 11:15 Ryan Williams - The Orthogonal Vectors Conjecture and Non-Uniform Circuit Lower Bounds
11:15 - 12:00 Joakim Blikstad - Maximum Flow by Augmenting Paths in n^(2+o(1)) Time
12:15 - 13:30 Lunch (Scarman - Warwick Conferences)
14:00 - 14:45 Shuichi Hirahara - Planted Clique Conjectures are Equivalent
14:45 - 15:30 Nutan Limaye - Recent Progress on Algebraic Circuit Lower Bounds
15:30 - 16:00 Coffee
16:00 - 16:45 Christian Coester - The Randomized k-Server Conjecture is False!
Page updated
Google Sites
Report abuse