Friday, December 16, 2022,   NYCAC 2022 will take place virtually, on Webex
All the talks will take place on Webex. Make sure to register, to receive a link.
8:00-8:40 | Vaggos Chatziafratis |
Approximate Representation Learning from Non-Metric Constraints |
8:40-9:15 | Lane A. Hemaspaandra |
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting |
9:15-9:55 | Vasilis Gkatzelis | Learning-Augmented Mechanism Design |
9:55-10:10 | short break | |
10:10-10:35 | Antonis Achilleos | To Monitorability and Beyond |
10:35-11:00 | Aggela Chalki |
A logical characterization of self-reducible counting problems the decision version of which is easy |
11:00-11:45 | Eric Allender |
Kolmogorov Complexity Characterizes Statistical Zero Knowledge |
11:45-12:30 | Phokion Kolaitis | Structure and Complexity of Bag Consistency |
12:30-13:30 | long break | |
13:30-14:15 | Moti Yung | Cryptographic Protocols: From Theory to Practice |
14:15-14:40 | Manolis Vlatakis |
The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points |
14:40-15:05 | Shivam Nadimpalli | Convex Influences |
15:05-15:30 | Miranda Christ |
The Smoothed Complexity of Policy Iteration for Markov Decision Processes |
15:30 | end. |