Friday, November 13, 2009,  
New York City
The Graduate Center, CUNY
Room 8400
NYCAC, the New York Colloquium on Algorithms and Complexity is a biannual event.
Its purpose is to give the opportunity to graduate students in New York
to observe talks
of researchers from all areas of the theory of Algorithms and Computational Complexity.
Costis Dascalakis (MIT)
Ilias Diakonikolas (Columbia U.)
Martin Fürer (Penn State U.)
William Gasarch (U. Maryland)
Stuart Haber (Hewlett Packard Labs)
Lane A. Hemaspaandra (U. Rochester)
Milena Mihail (Georgia Tech)
Aris Pagourtzis (NTU of Athens and U. Rochester)
Moti Yung (Google Inc. and Columbia U.)
Stathis Zachos
Antonis Achilleos
Registration and participation are free, but enrollment is limited.
Technical Program
Abstracts
Venue
The Graduate Center, CUNY
Doctoral Program in Computer Science
NYCAC 1 (2007)
Selfreference link: http://www.sci.brooklyn.cuny.edu/~zachos/nycac2/
NYCAC 3