engineer university professor computer scientist
He is a professor in the faculty of mathematics and computer science at the Weizmann Institute. Ran Raz is well known for his work on interactive proof systems His two most-cited papers are Raz (1998) on multi-prover interactive proofs and Raz & Safra (1997) on probabilistically checkable proofs.
Ran Raz received Erdős Prize in 2002.
His work has been awarded in the top conferences in theoretical computer science.
In 2004, he received the best paper award in Association for Computing Machinery (ACM) Symposium on Theory of Computing (STOC) for Raz (2004), and the best paper award in Institute of Electrical and Electronics Engineers Conference on Computational Complexity (Commodity Credit Corporation) for Raz & Shpilka (2004). In 2008, the work Moshkovitz & Raz (2008) received the best paper award in Institute of Electrical and Electronics Engineers Symposium on Foundations of Computer Science (FOCS).
Selected publications Raz, Ran. Safra, Shmuel (1997), "A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP", Proc. STOC 1997, pp. 475–484, doi:10.1145/258533.258641, . Raz, Ran (1998), "A parallel repetition theorem", SIAM Journal on Computing 27 (3): 763–803, doi:10.1137/S0097539795280895 . Raz, Ran (2004), "Multi-linear formulas for permanent and determinant are of super-polynomial size", Proc.
STOC 2004, pp. 633–641, doi:10.1145/1007352.1007353, . Raz, Ran. Shpilka, Amir (2004), "Deterministic polynomial identity testing in non commutative models", Proc. CCC 2004, pp. 215–222, doi:10.1109/CCC.2004.1313845, . Moshkovitz, Dana.
Raz, Ran (2008), "Two query PCP with sub-constant error", Proc. FOCS 2008, pp. 314–323, doi:10.1109/FOCS.2008.60.
