Friday, November 15, 2013,
New York City
The Graduate Center, CUNY
Room 4102 (Science Center)
The talks will take place in room 4102 (4th floor).
| 8:30 | Registration and coffee | Registration and coffee |
| 8:50 | Charalampos (Babis) Papamanthou | Trustworthy Computing with Untrusted Resources |
| 9:30 | Rosario Gennaro | A Survey of Verifiable Delegation of Computations |
| 10:10 | Valia Mitsou | The Computational Complexity of the Game Set and its Theoretical Applications. |
| 10:50 | Break | |
| 11:05 | Eric Allender | Revisiting some Questions about the Structure of Complete Sets |
| 11:45 | Kenneth W. Regan | Analyzing Quantum Circuits Via Polynomials |
| 12:25 | Wen-Ju Cheng | Random Walks and Log Space Complexity |
| 13:00 | Break | |
| 13:45 | Costantinos Daskalakis | Reductions from Mechanism to Algorithm Design |
| 14:25 | Steve Homer | Trading Mutual Information for Efficient Computation |
| 14:55 | Dimitris Paparas | The Complexity of Non-Monotone Markets |
| 15:30 | END |