Ran Raz
Princeton University
H-index: 57
North America-United States
Top articles of Ran Raz
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Quantum Logspace Computations are Verifiable | Uma Girish Ran Raz Wei Zhan | 2024 | |
On the works of Avi Wigderson | arXiv preprint arXiv:2307.09524 | Boaz Barak Yael Kalai Ran Raz Salil Vadhan Nisheeth K Vishnoi | 2023/7/18 |
Certified hardness vs. randomness for log-space | Edward Pyne Ran Raz Wei Zhan | 2023/11/6 | |
Memory-sample lower bounds for learning with classical-quantum hybrid memory | Qipeng Liu Ran Raz Wei Zhan | 2023/6/2 | |
Is untrusted randomness helpful? | Uma Girish Ran Raz Wei Zhan | 2023 | |
Oracle separation of BQP and PH | ACM Journal of the ACM (JACM) | Ran Raz Avishay Tal | 2022/8/31 |
Parallel repetition for all 3-player games over binary alphabet | Uma Girish Justin Holmgren Kunal Mittal Ran Raz Wei Zhan | 2022/6/9 | |
Polynomial bounds on parallel repetition for all 3-player games with binary inputs | arXiv preprint arXiv:2204.00858 | Uma Girish Kunal Mittal Ran Raz Wei Zhan | 2022/4/2 |
The work of Mark Braverman | Prize LectureS | Ran Raz | 2022 |
Quantum versus randomized communication complexity, with efficient players | computational complexity | Uma Girish Ran Raz Avishay Tal | 2022/12 |
Parallel repetition for the GHZ game: A simpler proof | arXiv preprint arXiv:2107.06156 | Uma Girish Justin Holmgren Kunal Mittal Ran Raz Wei Zhan | 2021/7/13 |
Memory-sample lower bounds for learning parity with noise | arXiv preprint arXiv:2107.02320 | Sumegha Garg Pravesh K Kothari Pengda Liu Ran Raz | 2021/7/5 |
Eliminating intermediate measurements using pseudorandom generators | arXiv preprint arXiv:2106.11877 | Uma Girish Ran Raz | 2021/6/22 |
A lower bound for adaptively-secure collective coin flipping protocols | Combinatorica | Yael Tauman Kalai Ilan Komargodski Ran Raz | 2021/2 |
How to delegate computations: the power of no-signaling proofs | ACM Journal of the ACM (JACM) | Yael Tauman Kalai Ran Raz Ron D Rothblum | 2021/11/29 |
The random-query model and the memory-bounded coupon collector | Innovations in Theoretical Computer Science Conference (ITCS 2020) | Ran Raz Wei Zhan | 2020/1 |
Near-quadratic lower bounds for two-pass graph streaming algorithms | Sepehr Assadi Ran Raz | 2020/11/16 | |
A parallel repetition theorem for the GHZ game | arXiv preprint arXiv:2008.05059 | Justin Holmgren Ran Raz | 2020/8/12 |
Lower bounds for XOR of forrelations | arXiv preprint arXiv:2007.03631 | Uma Girish Ran Raz Wei Zhan | 2020/7/7 |
Quantum logspace algorithm for powering matrices with bounded norm | arXiv preprint arXiv:2006.04880 | Uma Girish Ran Raz Wei Zhan | 2020/6/8 |
