top of page
The 4th AlgoUK Workshop
17-18 September, 2019
University of Warwick
AlgoUK is a series of UK-wide workshops, combining a UK Theory Day with an additional one-day workshop focusing on applications and applied areas relevant to Algorithms and Complexity.
The 4th AlgoUK workshop will take place on 17-18 September 2019 at the University of Warwick.
The first day will feature talks covering a broad selection of contemporary topics in Algorithms and Complexity.
The second day will be dedicated to Cryptography and Coding Theory; featuring speakers from both industry and academia. See schedule and speaker details below.
The talks will take place in Lecture Hall MS.02 of the Warwick Mathematics Institute (which is right next to Warwick's Department of Computer Science). For directions to the event, see the map of campus and directions.
A list of recommended hotels, both on-campus and in the nearby towns, can be found here. Availability may be limited, and so we recommend booking rooms ASAP.
AlgoUK can provide accommodation and travel funds for attendees (both staff and PhD students) at the meeting. However, funding is limited and will be on a first-come-first-served basis. We ask that attendees only request funding if they do not have an alternative means of funding available. Should anyone wish to request funding for attendance then can they please register this request by sending an e-mail to Professor Iain Stewart (email@example.com) who will note and affirm the request (funds permitting).
Participating in the event is free of charge, but please register here, so that we can make the proper arrangements.
Cryptography and Coding Theory
Algorithms and Complexity
Day 1 (September 17, MS.02, Warwick Mathematics Institute)
13:00 - 13:40 Daniel Paulusma: Graph Colouring for Hereditary Graph Classes and Beyond
13:40 - 14:20 Thomas Sauerwald: Random Walks on Dynamic Graphs
14:20 - 14:50 Coffee break
14:50 - 15:30 Christian Konrad: Randomized Greedy Matching in the Age of Massive Data Sets
15:30 - 16:10 Mary Cryan: Asymptotically optimal mixing-time bound on the bases-exchange Markov chain for a matroid
16:10 - 16:40 Coffee break
16:40 - 17:20 Christian Ikenmeyer: Geometric Complexity Theory
17:20 - 18:00 Paul Goldberg: The Computational Complexity of Consensus-Halving and Necklace-Splitting
18:15 - 19:00 Pub meeting in Radcliffe
19:00 - 21:00 Dinner at Radcliffe
Day 2 (September 18, MS.02, Warwick Mathematics Institute)
09:30 - 10:30 Madhu Sudan: General Strong Polarization
10:30 - 11:30 Adi Shamir: A Simple Explanation for the Mysterious Existence of Adversarial Examples with Small Hamming Distance
11:30 - 12:00 Coffee break
12:00 - 12:40 Adrià Gascón: Summation and Amplification in the Shuffle Model
12:40 - 13:20 Svetla Nikova: MPC meets the physical world: Threshold Crypto against Combined Physical Attacks
13:20 - 15:00 Lunch buffet
For any questions about the workshop, its schedule, or general information, please don’t hesitate to reach out to one of the organisers:
Graham Cormode (firstname.lastname@example.org)
Artur Czumaj (email@example.com)
Tom Gur (firstname.lastname@example.org)
The workshop will take place at the Warwick Mathematics Institute, Coventry CV4 7AL, UK
bottom of page