Schedule
Day 1: 14th Aug 2016 (Sunday)
9:15 AM to 9:30 AM Welcome Message
9:30 AM to 10:25 AM Srikanth Srinivasan Talk Title: A Recent Average Case Depth Hierarchy Theorem for Constant-Depth Circuits
10:30 AM to 11:00 AM Tea/Coffee Break
11:00 AM to 11:55 AM Rahul Santhanam Talk Title: Only Connect - From Learning to Primes
12:00 noon to 02:00 PM Lunch
2:00 PM to 2:55 PM Eshan Chattopadhyay Talk Title: Explicit Constructions of Two-Source Extractors
3:00 PM to 3:30 PM Tea/Coffee Break
3:30 PM to 4:25 PM Rohit Gurjar Talk Title: Bipartite matching is in quasi-NC
7:00 PM to 8:30 PM Dinner
8:30 PM to 9:25 PM Venkatesh Raman Talk title: 25 years of parameterizations
Day 2: 15th Aug 2016 (Monday)
9:30 AM to 10:25 AM Saket Saurabh Talk Title: 25 Years of Kernelization, Compressed to 55 Minutes
10:30 AM to 11:00 AM Tea/Coffee Break
11:00 AM to 11:55 AM Daniel Lokshtanov Talk Title: Lossy Kernelization
12:00 noon to 02:00 PM Lunch
2:00 PM to 2:55 PM Prahladh Harsha Talk Title: On polynomial approximations to AC0
3:00 PM to 3:30 PM Tea/Coffee Break
3:30 PM to 4:25 PM Ola Svensson Talk Title: Lift-and-Round to Improve Scheduling on Unrelated Machines
7:00 PM to 8:30 PM Dinner
8:30 PM to 9:25 PM Danupon Nanongkai Talk Title: A survey on dynamic graph algorithms and complexity
Day 3: 16th Aug 2016 (Tuesday)
9:30 AM to 10:25 AM Sayan Bhattyacharya Talk Title: Design of dynamic algorithms via primal-dual method
10:30 AM to 11:00 AM Tea/Coffee Break
11:00 AM to 11:55 AM Samir Datta Talk Title: Dynamic Complexity: the import of old ideas
12:00 noon to 02:00 PM Lunch
2:00 PM to 2:55 PM Nisheeth Vishnoi Talk title: Finding Sparse Vectors in an Affine Space
3:00 PM to 3:20 PM Tea/Coffee Break
3:20 PM to 4:15 PM Anirban Dasgupta Talk Title: Approximate Modularity
4:15 PM to 4:35 PM Tea/Coffee Break
4:35 PM to 5:30 PM Amit Deshpande Talk Title: An interplay of SVD and k-means
7:00 PM to 8:30 PM Dinner
8:30 PM to 9:25 PM Rajesh Sundaresan Talk Title: An overview of the cavity method and the BP algorithm
Day 4: 17th Aug 2016 (Wednesday)
9:30 AM to 10:25 AM Prateek Jain Talk Title: Near Optimal Robust Matrix Completion via Non-convex Optimization
10:30 AM to 11:00 AM Tea/Coffee Break
11:00 AM to 11:55 AM Anima Anandkumar Talk Title: Guaranteed Non-convex Learning Algorithms through Tensor Decomposition
12:00 noon to 02:00 PM Lunch
-- End of Workshop --

Mysore Park Theory Workshop 2016