Program
June 7 |
|
| 09:30-09:50 | Meeting and Coffee (Eshkol Tower, 30th floor) |
| 09:50-10:00 | Greetings |
| 10:00-10:40 |
Harry Buhrman, CWI, Amsterdam Reverse Newman's Theorems |
| 10:40-11:20 |
Michael Elkin, BGU Hopsets with Constant Hopbound |
| 11:20-11:40 | Coffee Break |
| 11:40-12:20 |
Noam Nisan, HUJI The Communication Complexity of Cake-Cutting |
| 12:20-13:00 |
Yuval Rabani, HUJI Matrix Balancing in Lp norms: A New Analysis of Osborne’s Iteration |
| 13:00-14:50 | Lunch Break (CRI, Education Building, 6th floor) |
| 14:00-14:40 | A Guided Excursion to Hecht Museum |
| 14:50-15:30 |
Hagit Attiya, Technion Fences and RMRs Required for Synchronization |
| 15:30-16:10 |
Nati Linial, HUJI Hypertrees |
| 16:10-16:40 | Coffee Break |
| 16:40-17:20 |
Alex Samorodnitsky, HUJI Induced Subgraphs of the Cube with Largest Maximal Eigenvalue |
| 18:30 | Conference Dinner (Eshkol Tower, 30th floor) |
June 8 |
|
| 09:30-10:00 | Meeting and Coffee (CRI, Education Building 570) |
| 10:00-10:40 |
Noga Alon, TAU Graph Coloring: Local and Global |
| 10:40-11:20 |
Ilan Newman, UoH On Metrics and on Simplicial Complexes |
| 11:20-11:40 | Coffee Break |
| 11:40-12:20 |
Mario Szegedy, Rutgers University, NJ What Do Robots Have To Do with sqrt(log n)? - The (n+1) Stack Problem |
| 12:20-13:00 |
Michael Krivelevich, TAU Finding and Using Expanders in Locally Sparse Graphs |
| 13:00-14:30 | Lunch Break (CRI, Education Building, 6th floor) |
| 14:30-15:10 |
Yishay Mansour, TAU Robust Inference and Local Algorithms |
| 15:10-15:50 |
Oded Lachish, Birkbeck, London Trading Query Complexity for Sample-Based and Multi-Testing Scalability |
| 15:50-16:20 | Coffee Break |
| 16:20-17:00 |
Eldar Fischer, Technion Improved Distribution Testing for Shape Restrictions |
