NYCAC 2017 - Schedule of Talks

Friday, November 17, 2017,   New York City
The Graduate Center, CUNY
Room C205 (concourse level) and the Recital Hall (ground floor, next to the lobby)

The New York Colloquium on Algorithms and Complexity


Schedule of talks (tentative)

All the talks will take place in Room C205 (concourse level),
except for the talk of Christos Papadimitriou, which will take place
at 11:15am in the Recital Hall (ground floor, next to the lobby).

  9:00 - 9:30 Registration and coffee
  9:30 - 10:15 Eric Allender Minimum Circuit Size, Graph Isomorphism and Related Problems
10:15 - 10:45 Alexander Golovnev On the Quantitative Hardness of CVP
10:45 - 11:15 Coffee Break
11:15 - 12:15 Christos Papadimitriou A computer scientist thinks about the brain
12:15 - 13:45 Lunch Break
13:45 - 14:30 Lane Hemaspaandra Recursion-Theoretic Ranking and Compression
14:30 - 15:15 Mihalis Yannakakis The Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer
15:15 - 15:30 Coffee Break
15:30 - 16:15 Dimitris Fotakis The Size and the Approximability of Minimum Temporally Connected Subgraphs
16:15 - 17:00 Manolis Zambetakis Ten Steps of EM Suffice for Mixtures of Two Gaussians
17:00 - 17:15 Coffee Break
17:15 - 18:00 Martin Fürer Multi-Clique-Width, a Powerful New Width Parameter
18:00 END