Date |
Guest |
Title |
25.2 |
Reuven Y. Rubinstein, Technion |
A Generic Minimum Cross-Entropy Algorithm
for Counting the Number of Satisfiability Assignments |
11.3 |
Ittai Abraham, the Hebrew University |
Distributed Computing Meets Game Theory: upper and lower bounds for mediator
implementation with cheap talk. |
18.3 |
Ori Shalev, TAU |
Techniques for Building Highly Concurrent Data Structures |
25.3 |
Shai Shalev-Shwartz |
Convex Repeated Games, Regret, and Duality
|
15.4 |
Daniel Lehmann, The Hebrew U |
A presentation of Quantum Logic based on an "and then" connective |
22.4 |
Partial overlap with Memorial day ceremony |
- |
29.4 |
Chen Avin, Ben Gurion University |
Enhancing Random Walks Efficiency |
6.5 |
No meeting this week |
Midrasha Matematica @HUJI. "Graphs, Polytopes and Convexity" (whole week) |
13.5 |
Gill Barequet, Technion |
A new lower bound on Klarner's constant |
20.5 |
Avi Wigderson, Inst. of advanced studies |
The art of reduction |
27.5 |
Adi Shamir, Weizmann Inst. |
New Cryptanalytic
Techniques in Multivariate Cryptography |
3.6 |
Yuval Ishai, Technion |
Zero-Knowledge from Secure Multiparty Computation |
10.6 |
Linda Kaufman, William Paterson U |
Implementing the Retraction Algorithm for factoring symmetric banded matrices
|
17.6 |
Elad Verbin, Tel Aviv University |
Text-Compression using the Burrows-Wheeler Transform
|
24.6 |
Andrei Sharf,
Tel Aviv University |
Surface Reconstruction Techniques for Imperfect
Raw-Data
|