top of page
Lower Bounds, Randomness, Space Complexity, and Quantum Computation
Celebrating Ran Raz’s 60th Birthday
Dates: February 27-29, 2026.
Organizers: Gil Cohen and Amir Shpilka (Tel Aviv University)
This conference brings together researchers working on central questions in computational complexity. The program will focus on several interconnected themes, including lower bounds, the role of randomness in computation, space-bounded computation, and quantum computation — areas in which Ran Raz has made seminal and lasting contributions. The conference will highlight recent developments, encourage new interactions between these areas, and celebrate Ran’s profound influence on theoretical computer science.
Speakers
Noga Alon, Princeton University
Shafi Goldwasser, MIT
Yael Tauman Kalai, MIT
Guy Kindler, the Hebrew University
Shay Moran, The Technion
Rotem Oshman, Tel Aviv University
Omer Reingold, Stanford University
Ron Rothblum, The Technion
Alex Samorodnitsky, The Hebrew University
Ronen Shaltiel, University of Haifa
Avishay Tal, UC Berkeley
Amir Yehudayoff, University of Copenhagen and the Technion
Location. The conference will take place at the Steinhardt Museum of Natural History, located adjacent to Tel Aviv University.
Registration. Registration is required for all participants; there is no registration fee.
bottom of page