Ran Raz | |
|---|---|
| רָן רָז | |
 | |
| Alma mater | Hebrew University of Jerusalem |
| Awards | Erdős Prize |
| Scientific career | |
| Fields | |
| Institutions | |
| Thesis | Communication Complexity and Circuit Lower Bounds (1992) |
| Doctoral advisor |
|
| Website | www |
Ran Raz (Hebrew: רָן רָז) is a 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.[1]
Raz received his Ph.D. at the Hebrew University of Jerusalem in 1992 under Avi Wigderson and Michael Ben-Or.[2]
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.[3]
Raz received the Erdős Prize in 2002. In 2004, he received the best paper award in ACM Symposium on Theory of Computing for Raz (2004),[4] and the best paper award in IEEE Conference on Computational Complexity for Raz & Shpilka (2004).[5] In 2008, the work Moshkovitz & Raz (2008) received the best paper award in IEEE Symposium on Foundations of Computer Science (FOCS).[6]
- ^ "Raz, Weinberg Deepen Faculty's Leadership in Critical Areas | Computer Science Department at Princeton University". www.cs.princeton.edu. Retrieved 2017-02-13.
- ^ Ran Raz at the Mathematics Genealogy Project
- ^ Citations counts for Raz (1998) as of 21 Feb 2009: Google Scholar: 313, ISI Web of Knowledge: 120, ACM Digital Library: 57 + 17, MathSciNet: 53. Citations counts for Raz & Safra (1997) as of 21 Feb 2009: Google Scholar: 314, ACM Digital Library: 71, MathSciNet: 59.
- ^ Proc. STOC 2004: "STOC 2004 Conference Awards", page x. [1]. One of two award papers.
- ^ Proc. CCC 2004: "Awards", page x. [2].
- ^ Proc. FOCS 2008: "Foreword", page xii. [3].