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. He is now a professor of computer science at Princeton University.[1]
Ran Raz received his Ph.D. at the Hebrew University of Jerusalem in 1992 under Avi Wigderson and Michael Ben-Or.[2]
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.[3]
Ran Raz received the 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),[4] and the best paper award in IEEE Conference on Computational Complexity (CCC) for Raz & Shpilka (2004).[5] In 2008, the work Moshkovitz & Raz (2008) received the best paper award in IEEE Symposium on Foundations of Computer Science (FOCS).[6]
YouTube Encyclopedic
-
1/2Views:402311
-
Fast learning requires good memory - Ran Raz
-
How to Delegate Computations: The Power of No-Signaling Proofs
Transcription
Selected publications
- Raz, Ran; Safra, Shmuel (1997), "A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP", Proc. STOC 1997, pp. 475–484, CiteSeerX 10.1.1.34.6957, doi:10.1145/258533.258641, ISBN 978-0-89791-888-6, S2CID 15457604.
- Raz, Ran (1998), "A parallel repetition theorem", SIAM Journal on Computing, 27 (3): 763–803, CiteSeerX 10.1.1.35.6859, doi:10.1137/S0097539795280895.
- Raz, Ran (2004), "Multi-linear formulas for permanent and determinant are of super-polynomial size", Proc. STOC 2004, pp. 633–641, CiteSeerX 10.1.1.2.9694, doi:10.1145/1007352.1007353, ISBN 978-1-58113-852-8, S2CID 1297877.
- Raz, Ran; Shpilka, Amir (2004), "Deterministic polynomial identity testing in non commutative models", Proc. CCC 2004, pp. 215–222, CiteSeerX 10.1.1.104.293, doi:10.1109/CCC.2004.1313845, ISBN 978-0-7695-2120-6.
- Moshkovitz, Dana; Raz, Ran (2008), "Two query PCP with sub-constant error", Proc. FOCS 2008, pp. 314–323, CiteSeerX 10.1.1.140.2111, doi:10.1109/FOCS.2008.60, ISBN 978-0-7695-3436-7.
Notes
- ^ "Raz, Weinberg Deepen Faculty's Leadership in Critical Areas | Computer Science Department at Princeton University". www.cs.princeton.edu. Retrieved 2017-02-13.
- ^ Ran Raz at the Mathematics Genealogy Project
- ^ 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.
- ^ Proc. STOC 2004: "STOC 2004 Conference Awards", page x. [1]. One of two award papers.
- ^ Proc. CCC 2004: "Awards", page x. [2].
- ^ Proc. FOCS 2008: "Foreword", page xii. [3].
| International | |
|---|---|
| National | |
| Academics | |
This page was last edited on 11 April 2024, at 16:11