Ran Raz received his Ph.D. in 1992 from Hebrew University under the supervision of Michael Ben-Or and Avi Wigderson. Since 1994, he has been a faculty member in the Faculty of Mathematics and Computer Science at the Weizmann Institute. His main research area is complexity theory, with emphasis on proving lower bounds for computational models. More specifically, he is interested in Boolean circuit complexity, arithmetic circuit complexity, communication complexity, propositional proof theory, probabilistically checkable proofs, quantum computation and communication, and randomness and derandomization.