Past Visiting Professor
Ran Raz
Funding provided by the National Science Foundation
From
–
Ran Raz’s main research area is complexity theory, with emphasis on proving lower bounds for computational models. More specifically, he is interested in Boolean and arithmetic circuit complexity, communication complexity, propositional proof theory, probabilistically checkable proofs, quantum computation and communication, and randomness and derandomization.
Dates at IAS
Visiting Professor
School of Mathematics
–
Visiting Professor
School of Mathematics
–
Visiting Professor
School of Mathematics
–
Fall
Member
School of Mathematics
–
Fall
Member
School of Mathematics
–
Degrees
Hebrew University
Ph.D.
1992
