Ran Raz is a Professor of Theoretical Computer Science at the Weizmann Institute of Science. He received his BSc in Mathematics and Physics and PhD in Mathematics from the Hebrew University, and after a postdoc at Princeton University joined the Weizmann Institute. His main research area is complexity theory, with an emphasis on proving lower bounds for various computational models. More specifically, he is interested in Boolean and arithmetic circuit complexity, communication complexity, probabilistically checkable proofs, quantum computation and communication, and randomness and derandomization.