Ran Raz

Ran Raz, 2011

Ran Raz (Hebrew: רָן רָז) 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 (1998) on multi-prover interactive proofs and Raz & Safra (1997) on probabilistically checkable proofs.[1]

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 ACM Symposium on Theory of Computing (STOC) for Raz (2004),[2] and the best paper award in IEEE Conference on Computational Complexity (CCC) for Raz & Shpilka (2004).[3] In 2008, the work Moshkovitz & Raz (2008) received the best paper award in IEEE Symposium on Foundations of Computer Science (FOCS).[4]

Selected publications

Notes

  1. 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.
  2. Proc. STOC 2004: "STOC 2004 Conference Awards", page x. . One of two award papers.
  3. Proc. CCC 2004: "Awards", page x. .
  4. Proc. FOCS 2008: "Foreword", page xii. .

External links


This article is issued from Wikipedia - version of the 11/14/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.