Ran Raz

About

Ran Raz joined the Princeton faculty in 2017. His 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. He completed a Ph.D. in mathematics at the Hebrew University of Jerusalem. After spending two years as a postdoc at Princeton, he joined the faculty of the Weizmann Institute of Science. From 2012-2016, he was a visiting professor at the Institute for Advanced Study.