Ran Raz

Ran Raz () is an Israeli computer scientist who works in the area of computational complexity theory. He was a professor in the Faculty of Mathematics and Computer Science at the Weizmann Institute before becoming a professor of computer science at Princeton University.

Raz received his Ph.D. at the Hebrew University of Jerusalem in 1992 under Avi Wigderson and Michael Ben-Or.

Raz is well known for his work on interactive proof systems. His two most-cited papers are on multi-prover interactive proofs and on probabilistically checkable proofs.Citations counts for as of 21 Feb 2009: Google Scholar: 313, ISI Web of Knowledge: 120, ACM Digital Library: 57 + 17, MathSciNet: 53. Citations counts for as of 21 Feb 2009: Google Scholar: 314, ACM Digital Library: 71, MathSciNet: 59.

Raz received the Erdős Prize in 2002. In 2004, he received the Best Paper Award at ACM Symposium on Theory of Computing for ,Proc. STOC 2004: "STOC 2004 Conference Awards", page x. . One of two award papers. and the best paper award in IEEE Conference on Computational Complexity for .Proc. CCC 2004: "Awards", page x. . In 2008, the work received the Best Paper Award at IEEE Symposium on Foundations of Computer Science (FOCS).Proc. FOCS 2008: "Foreword", page xii. .

Selected publications

. . . . .

References