NYCAC 2014 - Schedule of Talks

Friday, November 14, 2014,   New York City
The Graduate Center, CUNY
Room 4102 (Science Center)


The New York Colloquium on Algorithms and Complexity


Schedule of talks

The talks will take place in room 4102 (4th floor), except for the last one, which takes place in room 4421 (4th floor as well).

  8:30 - 9:00 Registration and coffee
  9:00 - 9:40 Xi Chen On the Complexity of Nash Equilibria in Anonymous Games
  9:50 - 10:30 Rocco Servedio A Probably Approximately Correct Lower Bound for Non-Adaptive Boolean Function Monotonicity Testing
10:30 - 11:00 Coffee Break
11:00 - 11:40 Alan Selman Disjoint NP-pairs and Propositional Proof Systems
11:50 - 12:20   Lane Hemaspaandra    Control in the Presence of Manipulators: Cooperative and Competitive Cases
12:20 - 14:20 Lunch Break
14:20 - 15:00 Daniel Stefankovic Spin models: connections between complexity, phase transition, belief propagation, and induced matrix norms
15:10 - 15:50 Moti Yung Surveillance Adversary Protocols: past and future
16:20 - 16:50 Manolis Zambetakis* Mechanism Design in presence of Verification and Applications*
17:00 END

*Room change: This talk takes place in room 4421.