|
Ran Raz is a computer scientist who works in the area of computational complexity theory. 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 on multi-prover interactive proofs and Raz & Safra on probabilistically checkable proofs.
Ran Raz received Erdős Prize is 2002. His work has been awarded in the top conferences in theoretical computer science. In 2004, he received the best paper award in ACM Symposium on Theory of Computing for Raz, and the best paper award in IEEE Conference on Computational Complexity for Raz & Shpilka. In 2008, the work Moshkovitz & Raz received the best paper award in IEEE Symposium on Foundations of Computer Science.
|
