Ran Raz

Ran Raz is a Professor in the Department of Computer Science at Princeton University. He joined the Princeton faculty in 2017. His research focuses on complexity theory, particularly proving lower bounds for computational models. His work includes 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.

Ran Raz is a computational complexity theorist at Princeton University, known for his work on the theoretical foundations of computer science. His research focuses on computational complexity, with an emphasis on probabilistically checkable proofs (PCP), parallel repetition theorems, and quantum communication complexity. He has made significant contributions to understanding the limits of efficient computation, including the hardness of approximation problems and the separation of complexity classes. His work also explores randomness extraction, error reduction in algorithms, and the complexity of matrix operations. Raz's research has implications for cryptography, algorithm design, and the theoretical limits of computation.