NYCAC 2018 - Schedule of Talks

Friday, November 16, 2018,   New York City
The Graduate Center, CUNY
Room 4102 (Science Center, 4th floor)


The New York Colloquium on Algorithms and Complexity


Schedule of talks (tentative)

All the talks will take place in Room 4102 (Science Center, 4th floor)

  8:30 - 9:00 Registration and coffee
  9:00 - 9:10 Welcome
  9:00 - 10:00 Costis Daskalakis Efficient Statistics from Truncated and Dependent Samples
10:00 - 10:30 Coffee Break
10:30 - 11:10 Omri Weinstein Static Data Structure Lower Bounds Imply Rigidity
11:10 - 11:50 Vasilis Gkatzelis Cost-Sharing Methods for Scheduling Games under Uncertainty
11:50 - 12:30 Subhash Khot The 2-to-2 Games Theorem
12:30 - 14:00 Lunch Break
14:00 - 14:40 Antonis Achilleos Adventures in Monitorability
14:40 - 15:20 Alexandr Andoni Spectral partitions for metrics & nearest neighbor search
15:20 - 16:00 Nikos Triandopoulos Append-only Authenticated Dictionaries with Polylogarithmic Proofs
16:00 - 16:30 Coffee Break
16:30 - 17:05 Periklis A. Papakonstantinou Query complexity for leaky inputs
17:05 - 17:20 Hafiz Asif Outlier detection and privacy
17:20 - 18:00 Manolis Zambetakis PPP-completeness with Connections to Cryptography
18:00 END