View source for Ran Raz

{{Infobox scientist
| name              = Ran Raz
| native_name       = {{Script/Hebrew|רָן רָז}}
| image             = רן רז, 2011.jpg
| birth_date        = <!--{{birth date |YYYY|MM|DD}}-->
| nationality       =
| fields            = {{Plainlist|
*[[Computer science]]
*[[Computational complexity theory]]
}}
| workplaces        = {{Plainlist|
*[[Princeton University]]
*[[Weizmann Institute]]
}}
| alma_mater        = [[Hebrew University of Jerusalem]]
| thesis_title      = Communication Complexity and Circuit Lower Bounds
| thesis_year       = 1992
| doctoral_advisor  = {{Plainlist|
*[[Avi Wigderson]]
*Michael Ben-Or
}}
| doctoral_students =
| known_for         =
| awards            = [[Erdős Prize]]
| website           = {{URL|http://www.wisdom.weizmann.ac.il/~ranraz/}}
}}
'''Ran Raz''' ({{langx|he|רָן רָז}}) 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]].<ref>{{Cite web|url=https://www.cs.princeton.edu/news/raz-weinberg-deepen-faculty%E2%80%99s-leadership-critical-areas|title=Raz, Weinberg Deepen Faculty's Leadership in Critical Areas {{!}} Computer Science Department at Princeton University|website=www.cs.princeton.edu|language=en|access-date=2017-02-13}}</ref>
Raz received his Ph.D. at the [[Hebrew University of Jerusalem]] in 1992 under [[Avi Wigderson]] and Michael Ben-Or.<ref>{{MathGenealogy|102217}}</ref>
Raz is well known for his work on [[interactive proof system]]s. His two most-cited papers are {{harvtxt|Raz|1998}} on [[multi-prover interactive proof]]s and {{harvtxt|Raz|Safra|1997}} on [[probabilistically checkable proof]]s.<ref>Citations counts for {{harvtxt|Raz|1998}} as of 21 Feb 2009: Google Scholar: [https://scholar.google.com/scholar?cites=10807229652058907596 313], ISI Web of Knowledge: 120, ACM Digital Library: [http://portal.acm.org/citation.cfm?id=284995.285007 57] + [http://portal.acm.org/citation.cfm?id=225058.225181 17], MathSciNet: [https://www.ams.org/mathscinet-getitem?mr=1612640 53]. Citations counts for {{harvtxt|Raz|Safra|1997}} as of 21 Feb 2009: Google Scholar: [https://scholar.google.com/scholar?cites=16406540695585643205 314], ACM Digital Library: [http://portal.acm.org/citation.cfm?id=258533.258641 71], MathSciNet: [https://www.ams.org/mathscinet-getitem?mr=1715654 59].</ref>
Raz received the [[Erdős Prize]] in 2002. In 2004, he received the best paper award in ACM [[Symposium on Theory of Computing]] for {{harvtxt|Raz|2004}},<ref>Proc. STOC 2004: "STOC 2004 Conference Awards", page x. [http://portal.acm.org/toc.cfm?id=1007352]. One of two award papers.</ref> and the best paper award in IEEE [[Conference on Computational Complexity]] for {{harvtxt|Raz|Shpilka|2004}}.<ref>Proc. CCC 2004: "Awards", page x. [https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=29139&isYear=2004].</ref> In 2008, the work {{harvtxt|Moshkovitz|Raz|2008}} received the best paper award in IEEE [[Symposium on Foundations of Computer Science]] (FOCS).<ref>Proc. FOCS 2008: "Foreword", page xii. [https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=4690924&isYear=2008].</ref>
==Selected publications==
*{{citation
| last1=Raz | first1=Ran
| last2=Safra | first2=Shmuel
| chapter=A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
| title=Proc. STOC 1997
| year=1997
| pages=475–484
| doi=10.1145/258533.258641
| isbn=978-0-89791-888-6
| title-link=Symposium on Theory of Computing
| citeseerx=10.1.1.34.6957
| s2cid=15457604
}}.
*{{citation
| last=Raz | first=Ran
| title=A parallel repetition theorem
| journal=[[SIAM Journal on Computing]]
| volume=27
| year=1998
| issue=3
| pages=763–803
| doi=10.1137/S0097539795280895
| citeseerx=10.1.1.35.6859
}}.
*{{citation
| chapter=Multi-linear formulas for permanent and determinant are of super-polynomial size
| last=Raz | first=Ran
| title=Proc. STOC 2004
| year=2004
| pages=633–641
| doi=10.1145/1007352.1007353
| isbn=978-1-58113-852-8
| title-link=Symposium on Theory of Computing | citeseerx=10.1.1.2.9694 | s2cid=1297877 }}.
*{{citation
| chapter=Deterministic polynomial identity testing in non commutative models
| last1=Raz | first1=Ran
| last2=Shpilka | first2=Amir
| title=Proc. CCC 2004
| year=2004
| pages=215–222
| doi=10.1109/CCC.2004.1313845
| isbn=978-0-7695-2120-6
| title-link=Conference on Computational Complexity | citeseerx=10.1.1.104.293 }}.
*{{citation
| chapter=Two query PCP with sub-constant error
| last1=Moshkovitz | first1=Dana | author1-link= Dana Moshkovitz
| last2=Raz | first2=Ran
| title=Proc. FOCS 2008
| year=2008
| pages=314–323
| doi=10.1109/FOCS.2008.60
| isbn=978-0-7695-3436-7
| title-link=Symposium on Foundations of Computer Science | citeseerx=10.1.1.140.2111 }}.
==References==
{{Reflist}}
{{Authority control}}
{{DEFAULTSORT:Raz, Ran}}
[[Category:Year of birth missing (living people)]]
[[Category:Living people]]
[[Category:Theoretical computer scientists]]
[[Category:Academic staff of Weizmann Institute of Science]]
[[Category:Israeli computer scientists]]
[[Category:Erdős Prize recipients]]
{{compu-scientist-stub}}