Schedule
|
|
09:30 - 10:00 |
Gathering, refreshments |
|
10:00 - 10:20 |
Greetings:
Tamir Tassa, The Department of Computer Science, The Open University
Hagit Messer-Yaron, President of the Open University
|
|
First Session: |
Chair - Manor Mendel |
|
10:20 - 11:10 |
Uri Zwick, Tel Aviv University
Local Improvement/Policy Iteration Algorithms
|
|
11:10 - 12:00 |
Piotr Indyk, MIT
Sparse Recovery Using Sparse Random Matrices
|
|
12:00 - 14:00 |
Lunch |
|
Second Session: |
Chair Tamir Tassa |
|
14:00 - 14:50
|
Shafi Goldwasser, Weizmann Institute
On the Possibility of Cryptography without (so many) Secrets
|
|
14:50 - 15:40
|
Amos Beimel, Ben Gurion University
Are There Efficient Secret Sharing Schemes?
|
|
15:40 - 16:10 |
Coffee Break |
|
Third Session: |
Chair - Michael Langberg
|
|
16:10 - 17:00 |
Zeev Nutov, The Open University
Design of Steiner Networks
|
|
17:00 - 17:50 |
Gil Kalai, The Hebrew University
Analysis and Probability of Boolean Functions
|
|
17:50 - 18:00 |
Concluding Remarks |
|
19:00 |
Dinner |
|