Past Visiting Professor

Ran Raz

Affiliation
Mathematics
Field of Study
Computational Complexity
From 9/2014 – 1/2017:

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
  • Mathematics
9/20141/2017
Visiting Professor
  • Mathematics
9/20136/2014
Visiting Professor
  • Mathematics
9/201212/2012 Fall
Member
  • Mathematics
9/200212/2002 Fall
Member
  • Mathematics
9/20006/2001
Degrees
Hebrew University Ph.D., 1992