The New York Colloquium on Algorithms and Complexity

Friday, November 13, 2009,   New York City
The Graduate Center, CUNY
Talks take place at room 8400, 8th floor

Tentative Program:

9:00 a.m.   Registration and coffee     Registration and coffee  
9:25 a.m. begin Welcome
9:30 a.m. Aris Pagourtzis Matching problems in blue-red graphs
10:10 a.m. Lane Hemaspaandra The Shield that Never Was: Societies with Single-Peaked
Preferences Are More Open to Manipulation and Control
10:55 a.m. Coffee Break Coffee Break
11:15 a.m. Costis Daskalakis Symmetries in Games, and the Complexity of Nash Equilibria
12:00 a.m. Milena Mihail Random Inner Product Graphs as Models for Complex Networks
12:45 p.m. Lunch Break Lunch Break
14:15 p.m. Martin Fürer The Combinatorial Approach to the Graph Isomorphism Problem
15:00 p.m. Stuart Haber Efficient signature schemes supporting redaction,
pseudonymization, and data deidentification
15:35 p.m. Coffee Break Coffee Break
15:55 p.m. William Gasarch Rectangle Free Coloring of Grids
16:35 p.m. Ilias Diakonikolas The power of bounded independence against threshold functions
17:10 p.m. Moti Yung How to Guard the Guards Themselves
17:55 p.m. end.  

Back to Main