Raz is a professor of theoretical computer science at Princeton University. He received his B.Sc. in mathematics and physics in 1987 and his Ph.D. in mathematics in 1992 from the Hebrew University of Jerusalem. After spending two years as a postdoc at Princeton University, in 1994 he joined the Weizmann Institute of Science in Israel. He was a visiting professor at Microsoft Research (2006, 2009) and the Institute for Advanced Study (2012–2016). Raz’s main research area is computational complexity theory, with a focus on proving lower bounds for computational models.
Raz’s main research area is complexity theory, with a focus on proving lower bounds for 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.