Ran Raz
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.
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 Raz (1998) on multi-prover interactive proofs and Raz & Safra (1997) on probabilistically checkable proofs.
Raz received the Erdős Prize in 2002. In 2004, he received the Best Paper Award at ACM Symposium on Theory of Computing for Raz (2004), and the best paper award in IEEE Conference on Computational Complexity for Raz & Shpilka (2004). In 2008, the work Moshkovitz & Raz (2008) received the Best Paper Award at IEEE Symposium on Foundations of Computer Science (FOCS).