Objective: The ARC Theory Day features hour-long lectures focusing on recent innovative results in theoretical computer science, spanning a wide array of topics several of which are inspired by practical problems.
Organizers: Prasad Tetali and Santosh Vempala (GA Tech)
Agenda
April 8: ARC Distinguished Lecture
- 3:00 pm Avrim Blum, (CMU): Algorithmic Pricing
April 9: ARC Theory Day
- 9:15 am - Breakfast
- 9:50 am - Welcome by Zvi Galil (CoC Dean)
- 10:00 am - Yael Kalai, (Microsoft Research): Efficient Error-Resilient Interactive Protocols
- 11:15 am - Raghu Meka, (Rutgers and IAS): Beating the Union Bound via Geometric Techniques
- 12:15 pm - Lunch Break
- 1:30 pm - Ankur Moitra, (Princeton and IAS): An Information Complexity Approach to Extended Formulations
- 2:45 pm - Thomas Rothvoss, (MIT): Approximating Bin Packing within O(log OPT * log log OPT) bins
