Friday, November 20, 2015,
New York City
The Graduate Center, CUNY
Room 9207
The talks will take place in room 9207 (9th floor).
| 8:30 - 9:00 | Registration and coffee | |
| 9:00 - 9:40 | Rosario Gennaro | Sequentially Composable Rational Proofs |
| 9:45 - 10:40 | Neil Immerman | The Complexity of Resilience and Responsibility for Conjunctive Queries |
| 10:40 - 11:10 | Coffee Break | |
| 11:10 - 11:50 | Nelly Fazio | Shared Oblivious Storage |
| 11:55 - 12:35 | Lance Fortnow | Nondeterministic Separations |
| 12:40 - 13:20 | Tal Malkin | Non-Malleable Codes for Bounded Depth Circuits |
| 13:20 - 15:00 | Lunch Break | |
| 15:00 - 15:40 | Eric Allender | Graph Automorphism and Circuit Size |
| 15:45 - 16:25 | Periklis Papakonstantinou | Efficient depth reduction for composites is possible |
| 16:25 - 17:00 | Coffee Break | |
| 17:00 - 17:40 | Dimitris Tsipras | Efficient Money Burning in General Domains |
| 17:45 - 18:15 | Lane A. Hemaspaandra | A Control Dichotomy for Pure Scoring Rules |
| 18:15 | END | |