Friday, November 18, 2016,  
New York City
The Graduate Center, CUNY
Room 9207 (9th floor)
9:30 - 10:00 | Registration and coffee | |
10:00 - 10:40 | Eric Allender | New Insights on the (Non)-Hardness of Circuit Minimization and Related Problems |
10:40 - 11:00 | Coffee Break | |
11:00 - 11:40 | Vasilis Gkatzelis | Approximating the Nash Social Welfare with Indivisible Items |
11:45 - 12:25 | Vasilis Syrgkanis | Computationally Efficient Learning in Auctions |
12:25 - 14:15 | Lunch Break | |
14:15 - 14:55 | William Gasarch | The Muffin Problem |
14:55 - 15:15 | Coffee Break | |
15:15 - 15:45 | Xi Chen | On the Query Complexity of Boolean Monotonicity Testing |
15:50 - 16:20 | Rocco Servedio | Learning Sums of Independent Commonly Supported Integer Random Variables |
16:20 - 16:40 | Coffee Break | |
16:40 - 17:10 | Alexandr Andoni | Optimal Hashing for High-Dimensional Spaces |
17:15 - 17:55 | Periklis Papakonstantinou | True Randomness from Big Data |
17:55 | END |