The New York Colloquium on Algorithms and Complexity

On the occasion of Stathis Zachos' retirement from CUNY.
Thursday, November 11, 2010,   New York City
The Graduate Center, CUNY
Talks take place at the Science Center (room 4102), 4th floor


9:00 a.m.   Registration and coffee     Registration and coffee  
9:30 a.m. Martin Fürer Combinatorial Methods for the Graph Isomorphism Problem
10:15 a.m. Mihalis Yannakakis Computational Aspects of Equilibria
11:00 a.m. Dexter Kozen Eliminating Hypotheses
11:45 a.m. Lunch Break Lunch Break
1:15 p.m. Milena Mihail High Dimensional Generalizations of Erdos-Renyi Random Graphs
2:00 p.m. Neil Immerman A Simple Inductive Synthesis Methodology and its Applications
2:45 p.m. Ken McAloon Report from the Front: Confronting NP-hard problems in practice
3:30 p.m. Coffee Break Coffee Break
4:15 p.m. Shafi Goldwasser Cryptography when Secrets are Hard to Keep*
5:30 p.m. Wine and Cheese Wine and Cheese

* This talk will be part of the CS colloquium and will take place in room 9204/9205

Back to Main