NYCAC 4 - Abstracts

Friday, November 18, 2011,   New York City
The Graduate Center, CUNY
Room 4102

The New York Colloquium on Algorithms and Complexity

(Tentative) Schedule of talks

9:00 Registration and coffee Registration and coffee
9:25 Welcome
9:30 Eric Allender Kolmogorov Complexity, Circuits, and the Strength of Logical Theories of Arithmetic
10:30 Christos Tzamos Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games
11:00 Coffee break
11:30 Bill Gasarch Using Ramsey's Theorem to Prove Programs Terminate
12:10 Martin Fürer Approximating k-Set Covers
12:50 Lunch break
14:30 George Karakostas Using reputation and misinformation to influence users in selfish routing
15:10 Michael Lampis The Landscape of Structural Graph Parameters
15:50 Coffee break
16:10 Vassilis Zikas Player-Centric Byzantine Agreement
16:50 Aris Tentes Hardness Preserving Constructions of Pseudorandom Functions
17:30 END