Ran Raz

U.S. National Science Foundation — United States

Computer Science · Physical Sciences

45h-index7.3kcitations220works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(139), Cryptography and Data Security(67), Quantum Computing Algorithms and Architecture(42), Computability, Logic, AI Algorithms(39), Machine Learning and Algorithms(30)

Publications220 total

On the works of Avi Wigderson
˜The œAbel prize·2024
Quantum Logspace Computations are Verifiable
Society for Industrial and Applied Mathematics eBooks·2024· 1 cited
The work of Mark Braverman
EMS Press eBooks·2023Open Access
Certified Hardness vs. Randomness for Log-Space
2023· 5 cited
Quantum Logspace Computations are Verifiable
arXiv (Cornell University)·2023Open Access
On the works of Avi Wigderson
arXiv (Cornell University)·2023Open Access
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory
2023· 5 cited
Certified Hardness vs. Randomness for Log-Space
arXiv (Cornell University)·2023Open Access
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory
arXiv (Cornell University)·2023Open Access
Quantum versus Randomized Communication Complexity, with Efficient Players
Computational Complexity·2022· 2 citedOpen Access
Parallel repetition for all 3-player games over binary alphabet
2022· 6 citedOpen Access
Oracle Separation of BQP and PH
Journal of the ACM·2022· 20 cited
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs
arXiv (Cornell University)·2022Open Access
Parallel Repetition For All 3-Player Games Over Binary Alphabet
arXiv (Cornell University)·2022Open Access
How to Delegate Computations: The Power of No-Signaling Proofs
Journal of the ACM·2021· 8 cited
Parallel Repetition for the GHZ Game: A Simpler Proof
arXiv (Cornell University)·2021Open Access
Memory-Sample Lower Bounds for Learning Parity with Noise
arXiv (Cornell University)·2021· 2 citedOpen Access
Eliminating Intermediate Measurements Using Pseudorandom Generators
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 2 citedOpen Access
Memory-Sample Lower Bounds for Learning Parity with Noise
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 1 citedOpen Access
Parallel Repetition for the GHZ Game: A Simpler Proof
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 1 citedOpen Access
page 1 of 11Next →

Frequent Co-authors

Avi Wigderson(6), Yael Tauman Kalai(5), Amir Yehudayoff(5), Muli Safra(3), Marı́a Luisa Bonet(3), Toniann Pitassi(3), Amir Shpilka(3), Ariel Gabizon(3), Cyril Gavoille(2), David Peleg(2), Stéphane Pérennès(2), Omer Reingold(2), Irit Dinur(2), Guy Kindler(2), Mauricio Karchmer(2), Ron D. Rothblum(2), Hani Neuvirth(1), Gideon Schreiber(1), Salil Vadhan(1), Kai-Min Chung(1)