Friday, November 16, 2012,
New York City
The Graduate Center, CUNY
Rooms: 5414 and 4102
The first talks will take place in room 5414 (5th floor) and during the 16:30 break we will move to room 4102 (4th floor), where we will stay until the end of the colloquium.
| 8:30 | Registration and coffee | Registration and coffee |
| 8:55 | Welcome | |
| 9:00 | Aggelos Kiayias | Secure Computation with Corruptible Setups |
| 10:00 | Mihalis Yannakakis | Computation of Least Fixed Points |
| 10:45 | Coffee Break | |
| 11:00 | Michael Lampis | Improved inapproximability for TSP: the role of bounded occurrence CSPs |
| 11:45 | Vasilis Gkatzelis | Mechanism Design for Fair Division |
| 12:30 | Stathis Zachos | Tribute to Alan Turing |
| 13:30 | Lunch break | |
| 15:00 | Jin-Yi Cai | Computational complexity theory --- The world of P and NP |
| 16:00 | Stuart Haber | No looking back: Efficient submatch extraction for extended regular expressions |
| 16:30 | Coffee break | |
| 16:45 | George Tourlakis | A proof theoretic tool for two first-order modal logics |
| 17:30 | Lane Hemaspaandra | Search versus Decision for Election Manipulation Problems |
| 18:15 | END |