Itinerary

Monday, December 26th

9:00-9:30 -- Reception

9:30-9:45 -- Opening

9:45-11:00 -- Yael Tauman Kalai (Microsoft, MIT) Recent Advancement in SNARGs

11:00-11:30 -- Coffee Break

11:30-12:45 -- Shachar Lovett (University of California, San Diego): The monomial structure of Boolean functions 

12:45-14:00 -- Lunch

14:00-14:30 -- Coffee Break

14:30-15:45 -- Noam Lifshitz (The Hebrew University): Product free sets in the alternating group 

Tuesday, December 27th

9:15-9:45 -- Reception

9:45-11:00 -- Assaf Naor (Princeton University) Reverse isoperimetry

11:00-11:30 -- Coffee Break

11:30-12:45 -- Amir Yehudayoff (Technion): Characterizations of learnability

12:45-14:00 -- Lunch

14:00-14:30 -- Coffee Break

14:30-15:45 -- Pravesh Kothari (Carnegie Mellon) The Kikuchi Matrix Method 

Wednesday, December 28th

9:15-9:45 -- Reception

9:45-11:00 -- Michal Feldman (Tel Aviv University) Algorithmic Contract Design 

11:00-11:30 -- Coffee Break

11:30-12:45 -- Aviad Rubinstein (Stanford University) Approximate maximum matching, and fantasies about SETH, obfuscation, and you

12:45-14:00 -- Lunch

14:00-14:30 -- Coffee Break

14:30-15:45 -- Eitan Bachmat (Ben Gurion University) An old disk scheduling algorithm revisited