Ran Raz ( he, רָן רָז) is a computer scientist who works in the area of

computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved ...

. He was a professor in the faculty of mathematics and computer science at the

Weizmann Institute The Weizmann Institute of Science ( he, מכון ויצמן למדע ''Machon Vaitzman LeMada'') is a public research university in Rehovot, Israel, established in 1934, 14 years before the State of Israel. It differs from other Israeli univ ...

. He is now a professor of computer science at

Princeton University Princeton University is a private research university in Princeton, New Jersey. Founded in 1746 in Elizabeth as the College of New Jersey, Princeton is the fourth-oldest institution of higher education in the United States and one of the ...

. Ran Raz received his Ph.D. at the Hebrew University of Jerusalem in 1992 under

Avi Wigderson Avi Wigderson ( he, אבי ויגדרזון; born 9 September 1956) is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jerse ...

and Michael Ben-Or. Ran Raz is well known for his work on

interactive proof system In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a ''prover'' and a ''verifier''. The parties interact by exchanging messages in order t ...

s. His two most-cited papers are on multi-prover interactive proofs and on

probabilistically checkable proof In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm is ...

s. Ran Raz received the

Erdős Prize The Anna and Lajos Erdős Prize in Mathematics is a prize given by the Israel Mathematical Union to an Israeli mathematician (in any field of mathematics and computer science), "with preference to candidates up to the age of 40." The prize was ...

in 2002. His work has been awarded in the top conferences in

theoretical computer science computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumscribe the ...

. In 2004, he received the best paper award in ACM

Symposium on Theory of Computing The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for ...

(STOC) for , and the best paper award in IEEE

Conference on Computational Complexity The Computational Complexity Conference (CCC), is an academic conference in the field of theoretical computer science whose roots date to 1986. It fosters research in computational complexity theory, and is typically held annually between mid-May an ...

(CCC) for . In 2008, the work received the best paper award in IEEE Symposium on Foundations of Computer Science (FOCS).Proc. FOCS 2008: "Foreword", page xii

Selected publications

*. *. *. *. *.

Notes

Year of birth missing (living people) Living people Theoretical computer scientists Academic staff of Weizmann Institute of Science Israeli computer scientists Erdős Prize recipients {{compu-scientist-stub