האוניברסיטה הפתוחה
המחלקה למתמטיקה ולמדעי המחשב

The Open University
The Department of Mathematics and Computer Science

The Fifth Israel CS Theory Day
Sunday, March 25th, 2012
at The Open University, Dorothy de Rothschild Campus
1 University Road, Raanana

Schedule

09:30  10:00 
Gathering, refreshments 
10:00  10:15 
Greetings:
Tamir Tassa, The Department of Mathematics and Computer Science, The Open University (OUI)
Judith GalEzer, Vice President for Academic Affairs, OUI

First Session: 
Chair  Michael Langberg, The Department of Mathematics and Computer Science, OUI 
10:15  11:00 
Robert Krauthgamer, Weizmann Institute
Efficient Algorithms via Precision Sampling

11:00  11:45 
Michael Rabin, The Hebrew University and Harvard University
Secret, Incoercible and Deniable Bidding Countering Collusions in Auctions

11:45  12:30 
Ryan Williams, Stanford University
ACC Circuit Lower Bounds

12:30  14:00 
Lunch 
Second Session: 
Chair  Zeev Nutov, The Department of Mathematics and Computer Science, OUI 
14:00  14:45 
Yuval Ishai, Technion
The Complexity of Cryptography

14:45  15:30

Niv Buchbinder, The Open University
A PolylogarithmicCompetitive Algorithm for the kServer Problem

15:30  16:15 
Afternoon gathering 
Third Session: 
Chair  Tal Hassner, The Department of Mathematics and Computer Science, OUI

16:15  17:00 
Ronen Shaltiel, Haifa University
Dispersers for Affine Sources with Subpolynomial Entropy

17:00  17:45

Yossi Azar, Tel Aviv University
Fast Approximation Algorithms for Submodular Optimization Problems 
17:45  18:00 
Concluding Remarks 


