ARC Theory Day will be an annual event, to showcase lectures on recent exciting developments in theoretical computer science. This year's inaugural event features four young speakers who have made such valuable contributions to the field. In addition, this year we are fortunate to have Avi Wigderson from the Institute for Advanced Study (Princeton) speak on fundamental questions and progress in computational complexity to a general audience.
- 9:20 AM Welcome by Zvi Galil
- 9:30 AM Thomas Dueholm Hansen - Subexponential Lower Bounds For Randomized Pivoting Rules For The Simplex Algorithm
- 10:45 AM Aleksander Madry - Online Algorithms and The K-server Conjecture
- 1:30 PM Mohit Singh - A Randomized Rounding Approach for Symmetric TSP
- 2:45 PM Ryan Williams - Algorithms for Circuits and Circuits for Algorithms
See Poster for schedule of talks.
See ARC Theory Day Videos here.