Schedule
|
|
09:30 - 10:00 |
Gathering, refreshments |
|
10:00 - 10:20 |
Greetings:
Tamir Tassa, The Department of Mathematics and Computer Science, The Open University (OUI)
Kobi Metzer, President, OUI
|
|
First Session: |
Chair - Zeev Nutov, The Department of Mathematics and Computer Science, OUI |
|
10:20 - 11:10 |
Avinatan Hassidim, Bar Ilan University
Maximizing monotone submodular functions under noise |
|
11:10 - 12:00 |
Tim Roughgarden, Stanford University
How computer science informs modern auction design
|
|
12:00 - 13:00 |
Lunch |
|
Second Session: |
Chair - Moran Feldman, The Department of Mathematics and Computer Science, OUI |
|
13:00 - 13:50 |
Leonid Barenboim, The Open University
Distributed symmetry-breaking in static and dynamic networks |
|
13:50 - 14:40
|
Eli Ben-Sasson, Technion
Scalable computational integrity and privacy, with applications to Bitcoin and Zerocash
|
|
14:40 - 15:00 |
Afternoon gathering |
|
Third Session: |
Chair - Manor Mendel, The Department of Mathematics and Computer Science, OUI |
|
15:00 - 15:50 |
Guy Kindler, The Hebrew University
Playing 2-to-2 games with Grassman graphs |
|
15:50 - 16:40
|
Yuval Peres, Microsoft Research
Local max-cut in smoothed polynomial time |
| |
|
Participation is free. Pre-registration will be appreciated
Tel. *3337 or please press here.
|
