Friday, November 15, 2019,
New York City
The Graduate Center, CUNY
Room 4102 (Science Center, 4th floor)
All the talks will take place in Room 4102 (Science Center, 4th floor)
| 8:30 - 9:00 | Registration and welcome | |
| 9:00 - 9:45 | Eric Allender | The New Complexity Landscape around Circuit Minimization |
| 9:45 - 10:30 | Yiannis Koutis | Spectral graph modification for improved spectral clustering |
| 10:30 - 11:00 | Coffee Break | |
| 11:00 - 11:40 | Dana Ron | Fast, cheap, but in control: sublinear-time algorithms for approximate computations |
| 11:40 - 12:10 | Manolis Vlatakis | (Hidden) Zero-Sum Games: The Final (Non-Convex Non-Concave) Frontier *A story by Poincaré, Bendixson, Hamilton and von Neumann* |
| 12:10 - 12:40 | Vaggos Chatziafratis | Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem |
| 12:40 - 14:10 | Lunch Break | |
| 14:10 - 14:50 | Lane A. Hemaspaandra | Computational Social Choice and Computational Complexity: BFFs? |
| 14:50 - 15:30 | Marshall Ball | On the Complexity of Decomposable Randomized Encodings, or: How Friendly Can a Garbling-Friendly PRF be? |
| 15:30 - 16:10 | Antigoni Polychroniadou | Secure Multi-Party Computation for Federated Learning |
| 16:10 - 16:40 | Coffee Break | |
| 16:40 - 17:05 | Dimitris Tsipras | Robust ML: Progress, challenges, and a new perspective |
| 17:05 - 17:45 | Lydia Zakynthinou | Private Identity Testing for High Dimensional Distributions |
| 17:45 - 18:20 | Chara Podimata | Grinding the Space: Learning to Classify Against Strategic Agents |
| 18:20 | END | |