• 14:00-18:00 Registration (FIT Building)

• 8:00-8:50 Registration
• 8:50-9:00 Opening Remarks
• 9:00-10:00 Session 1(Chair:Anke van Zuylen)
  • Mohit Singh : Iterative Methods in Combinatorial Optimization
  • Lorenzo Orecchia : An Application of Online-Learning Methods to Quickly Find Approximate Sparsest Cuts
  10:00-10:30 Coffee Break
• 10:30-11:30 Session 2(Chair: Jayalal Sarma M.N.)
  • Homin Lee : Learning Monotone Functions
  • Alexander Sherstov : Communication Lower Bounds Using Dual Polynomials
• 12:00-14:00 Lunch
• 14:00-15:00 Session 3 (Chair:Xiaoming Sun)
  • Alexander Andoni : Overcoming the L_1 non-embeddability barrier: or Choose your host space wisely
  • Milan Ruzic : Near-Optimal Sparse Recovery in the L_1 norm
• 15:00-16:00 Coffee Break
• 16:00-17:00 Session4 (Chair: Elad Verbin)
  • Madhur Tulsiani : Dense Subsets of Pseudorandom Sets
  • Grant Schoenebeck : Linear Level Lasserre Lower Bounds for Certain k-CSPs
• 17:00-18:00 Panel Discussion
  
• 18:00-20:00 Reception Dinner

• 8:00-8:50 Registration
• 9:00-10:00 Invited talk (Chair:Andrew Yao)
  • Luca Trevisan : Max Cut and the Smallest Eigenvalue
• 10:00-10:30 Coffee Break
• 10:30-11:30 Session 5 (Chair: Christophe Tartary)
  • Per Austrin : A clearer picture of approximation resistance
  • Rishi Saket : Hardness of Minimizing and Learning DNF Expressions
• 12:00-14:00 Lunch
• 14:00-15:30 Session 6 (Chair: Frans Schalekamp)
  • Shai Gutner : The Dominating Set Problem on Graphs with an Excluded Minor
  • Virginia Vassilevska : Nondecreasing paths in a weighted graph
  • Ashish Choudhary : Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
• 15:30-16:00 Coffee Break
• 16:00-17:00 Session 7 (Chair: Andrej Bogdanov)
  • Chandan Saha : Fast Integer Multiplication Using Modular Arithmetic
  • Pinyan Lu : Holographic Reduction: Design Algorithms and Prove Hardness
• 17:00-18:00 Panel Discussion
• 18:00-20:00 Dinner
• 20:00-         Open Discussion

Wednesday, September 24th

• 8:00-8:50 Registration
• 9:00-10:00 Session 8 (Chair: Xiaoming Sun)
  • Seshadhri Commandur : Self-improving algorithms for Delaunay triangulations
  • Guy Rothblum : Delegating Computation: Interactive Proofs for Muggles
• 10:00-10:30 Coffee Break
• 10:30-11:30 Session 9 (Chair: Jayalal Sarma M.N.)
  • Kevin Matulef : Testing Halfspaces
  • Sourav Charabokty : An Online Multi-unit Auction for Perishable Goods with Unknown Supply
• 12:00-14:00 Lunch
• 14:00-15:30 Session 10 (Chair: Frans Schalekamp)
  • Katrina Ligett : A Learning Theory Approach to Non-Interactive Database Privacy
  • Zuzana Beerliova : Efficient Information-theoretically Secure MPC
  • Melissa Chase : Provably Secure Electronic Cash
• 15:30-16:00 Coffee Break
• 16:00-17:30 Session 11 (Chair: Elad Verbin)
  • Ragesh Jaiswal : New Proofs of (New) Direct Product Theorems
  • Ishay Haviv : Rounding Parallel Repetitions of Unique Games
  • Prasad Raghavendra : Optimal Algorithms and Inapproximability Results for every CSP?
• 17:30-18:00 Panel Discussion
• 18:00-20:00 Dinner

• 8:00-8:50 Registration
• 9:00-10:00 Session 12 (Chair: Andrej Bogdanov)
  • Jialin Zhang : Topological method in asynchronous distributed system
  • Arpita Patra : On Tradeoff Among Network Connectivity, Phase Complexity and Communication Complexity of Reliable Communication Tolerating Mixed Adversary
• 10:00-10:30 Coffee Break
• 10:30-11:30 Session 13 (Chair: Christophe Tartary)
  • Tal Moran : An Optimally Fair Coin Toss: Cleve's Bound is Tight
  • Anne Broadbent : Universal Blind Quantum Computation
• 12:00-14:00 Lunch
• 14:00-15:30 Session 14 (Chair: Anke van Zuylen)
  • Alexandra Kolla : Unique Games on expander graphs are easy
  • Or Meir : Combinatorial Construction of Locally Testable Codes
  • Swastik Kopparty : The Homomorphism Domination Exponent
• 15:30-16:00 Coffee Break
• 16:00-17:30 Panel Discussion
• 17:30-18:00 Closing Ceremony
• 18:00-20:00 Banquet Dinner