| Ran Raz | |
|---|---|
 | |
| Nama asal | רָן רָז |
| Almamater | Universitas Ibrani Yerusalem |
| Penghargaan | Penghargaan Erdős |
| Karier ilmiah | |
| Bidang | |
| Institusi | |
| Disertasi | Communication Complexity and Circuit Lower Bounds (1992) |
| Pembimbing doktoral |
|
| Situs web | www |
Ran Raz (bahasa Ibrani: רָן רָז) adalah seorang ilmuwan komputer yang bekerja dalam bidang teori kompleksitas komputasi. Ia adalah profesor di fakultas matematika dan ilmu komputer di Institut Weizmann. Ia kini menjadi profesor ilmu komputer di Universitas Princeton.[1]
Publikasi pilihan
sunting- 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, hlm. 475–484, CiteSeerX 10.1.1.34.6957, doi:10.1145/258533.258641, ISBN 978-0-89791-888-6.
- 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, hlm. 633–641, CiteSeerX 10.1.1.2.9694, doi:10.1145/1007352.1007353, ISBN 978-1-58113-852-8.
- Raz, Ran; Shpilka, Amir (2004), "Deterministic polynomial identity testing in non commutative models", Proc. CCC 2004, hlm. 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, hlm. 314–323, CiteSeerX 10.1.1.140.2111, doi:10.1109/FOCS.2008.60, ISBN 978-0-7695-3436-7.
Catatan
sunting- ^ "Raz, Weinberg Deepen Faculty's Leadership in Critical Areas | Computer Science Department at Princeton University". www.cs.princeton.edu (dalam bahasa Inggris). Diakses tanggal 2017-02-13.
