Dorit Aharonov
Hebrew University, co-advisor with M. Ben-Or, 1994-1998
Thesis: Noisy quantum computation
Roy Armoni
Hebrew University, co-advisor with M. Ben-Or, 1994-1998
Thesis: On the random resources needed by space-bounded computational models
Ziv Bar-Yossef
Hebrew University, 1997-1998
Thesis: Deterministic amplification of space-bounded randomized algorithms
Ron Ben-Nathan
Hebrew University, 1987-1990
Thesis: Transforming Probabalistic to Deterministic Algorithms
Eli Ben-Sasson
Hebrew University, 1997-2001
Thesis: Expansion in Proof Complexity
Aviad Cohen
Hebrew University, 1986-1991
Thesis: Disperser graphs, deterministic amplification and imperfect random sources
Joseph Gil
Hebrew University, 1986-1990
Thesis: Lower bounds and algorithms for hashing and parallel processing
Rafi Heiman
Weizmann Institute, 1987-1991
Thesis: Randomized decision tree complexity of read-once Boolean functions
Shlomo Hoory
Hebrew University, 1987-1990
Thesis: Universal sequences for expander graphs and contracting sequences on graphs
Mauricio Karchmer
Hebrew University, 1986-1988
Winner of the ACM Best Doctoral Thesis in Computer Science Award
Thesis: Complexity of computation and restricted machines
Ilan Newman
Hebrew University, 1987-1991
Thesis: On the formula complexity of simple boolean functions
Michal Parnas
Hebrew University, 1987-1990
Thesis: Approximate Counting, Almost Uniform Generation and Random Walks
Dana Pe'er
Hebrew University, 1997-1999
Thesis: On Minimum Spanning Trees
Yuri Rabinovich
Hebrew University, 1988-1992
Thesis: Monlinear Mixing and evolution of Combinatorial Systems
Prabhakar Ragde
U. C. Berkeley, co-advisor with R. Karp, 1983-1986
Thesis: Lower bounds for parallel computation
Ran Raz
Hebrew University, co-advisor with M. Ben-Or, 1988-1992
Thesis: Communication complexity and circuit lower bounds. Summary in English
Moti Reif
Ben-Gurion University, co-advisor with M. Rubin, 1987-1988
Thesis: Parallel algorithms for convex sets in \(R^2\) and \(R^3\)
Ronen Shaltiel
Hebrew University, 1997-2001
Thesis: Explicit constructions of pseudo-random generators and extractors
Roded Sharan
Hebrew University, 1994-1995
Thesis: Perfect Matching in Parallel Computation
Amir Shpilka
Hebrew University, 1997-2001
Thesis: Lower bounds for small depth arithmetic and Boolean circuits
David Xiao
Princeton University, 2004-2009
Thesis: New Perspectives on the Complexity of Computational Learning, and Other Problems in Theoretical Computer Science