Ran Raz

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 82

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

STOC

ITCS

Publications

Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Computations are Verifiable. SOSA (2024)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena
Information Dissemination via Broadcasts in the Presence of Adversarial Noise. CCC (2024)
Edward Pyne, Ran Raz, Wei Zhan
Certified Hardness vs. Randomness for Log-Space. CoRR (2023)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Computations are Verifiable. CoRR (2023)
Qipeng Liu, Ran Raz, Wei Zhan
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. STOC (2023)
Qipeng Liu, Ran Raz, Wei Zhan
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. Electron. Colloquium Comput. Complex. (2023)
Edward Pyne, Ran Raz, Wei Zhan
Certified Hardness vs. Randomness for Log-Space. FOCS (2023)
Qipeng Liu, Ran Raz, Wei Zhan
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. CoRR (2023)
Uma Girish, Ran Raz, Wei Zhan
Is Untrusted Randomness Helpful? ITCS (2023)
Boaz Barak, Yael Kalai, Ran Raz, Salil P. Vadhan, Nisheeth K. Vishnoi
On the works of Avi Wigderson. CoRR (2023)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Computations are Verifiable. Electron. Colloquium Comput. Complex. (2023)
Edward Pyne, Ran Raz, Wei Zhan
Certified Hardness vs. Randomness for Log-Space. Electron. Colloquium Comput. Complex. (2023)
Uma Girish, Ran Raz, Avishay Tal
Quantum versus Randomized Communication Complexity, with Efficient Players. Comput. Complex. 31 (2) (2022)
Uma Girish, Ran Raz
Eliminating Intermediate Measurements Using Pseudorandom Generators. ITCS (2022)
Ran Raz, Avishay Tal
Oracle Separation of BQP and PH. J. ACM 69 (4) (2022)
Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. Electron. Colloquium Comput. Complex. (2022)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel Repetition For All 3-Player Games Over Binary Alphabet. Electron. Colloquium Comput. Complex. (2022)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR (2022)
Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. CoRR (2022)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel repetition for all 3-player games over binary alphabet. STOC (2022)
Yael Tauman Kalai, Ran Raz, Ron D. Rothblum
How to Delegate Computations: The Power of No-Signaling Proofs. J. ACM 69 (1) (2022)
Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs. APPROX/RANDOM (2022)
Uma Girish, Ran Raz
Eliminating Intermediate Measurements using Pseudorandom Generators. Electron. Colloquium Comput. Complex. 28 (2021)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel Repetition for the GHZ Game: A Simpler Proof. APPROX-RANDOM (2021)
Anat Ganor, Gillat Kol, Ran Raz
Exponential Separation of Communication and External Information. SIAM J. Comput. 50 (3) (2021)
Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz
Memory-Sample Lower Bounds for Learning Parity with Noise. APPROX-RANDOM (2021)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. ICALP (2021)
Kunal Mittal, Ran Raz
Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear Lower Bounds for Turing Machines. ITCS (2021)
Uma Girish, Ran Raz, Avishay Tal
Quantum Versus Randomized Communication Complexity, with Efficient Players. ITCS (2021)
Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz
Memory-Sample Lower Bounds for Learning Parity with Noise. CoRR (2021)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof. Electron. Colloquium Comput. Complex. 28 (2021)
Uma Girish, Ran Raz
Eliminating Intermediate Measurements using Pseudorandom Generators. CoRR (2021)
Uma Girish, Ran Raz, Wei Zhan
Lower Bounds for XOR of Forrelations. APPROX-RANDOM (2021)
Yael Tauman Kalai, Ilan Komargodski, Ran Raz
A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols. Comb. 41 (1) (2021)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel Repetition for the GHZ Game: A Simpler Proof. CoRR (2021)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. Electron. Colloquium Comput. Complex. 27 (2020)
Uma Girish, Ran Raz, Wei Zhan
Lower Bounds for XOR of Forrelations. Electron. Colloquium Comput. Complex. 27 (2020)
Ran Raz, Wei Zhan
The Random-Query Model and the Memory-Bounded Coupon Collector. ITCS (2020)
Sumegha Garg, Pravesh K. Kothari, Ran Raz
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. APPROX-RANDOM (2020)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. CoRR (2020)
Kunal Mittal, Ran Raz
Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines. CoRR (2020)
Justin Holmgren, Ran Raz
A Parallel Repetition Theorem for the GHZ Game. CoRR (2020)
Sepehr Assadi, Ran Raz
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. CoRR (2020)
Kunal Mittal, Ran Raz
Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines. Electron. Colloquium Comput. Complex. 27 (2020)
Sepehr Assadi, Ran Raz
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. FOCS (2020)
Uma Girish, Ran Raz, Wei Zhan
Lower Bounds for XOR of Forrelations. CoRR (2020)
Sumegha Garg, Pravesh K. Kothari, Ran Raz
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. CoRR (2020)
Justin Holmgren, Ran Raz
A Parallel Repetition Theorem for the GHZ Game. Electron. Colloquium Comput. Complex. 27 (2020)
Ran Raz, Avishay Tal
Oracle separation of BQP and PH. STOC (2019)
Ran Raz, Wei Zhan
The Random-Query Model and the Memory-Bounded Coupon Collector. Electron. Colloquium Comput. Complex. 26 (2019)
Uma Girish, Ran Raz, Avishay Tal
Quantum versus Randomized Communication Complexity, with Efficient Players. CoRR (2019)
Uma Girish, Ran Raz, Avishay Tal
Quantum versus Randomized Communication Complexity, with Efficient Players. Electron. Colloquium Comput. Complex. 26 (2019)
Sumegha Garg, Ran Raz, Avishay Tal
Time-Space Lower Bounds for Two-Pass Learning. Computational Complexity Conference (2019)
Sumegha Garg, Ran Raz, Avishay Tal
Time-Space Lower Bounds for Two-Pass Learning. Electron. Colloquium Comput. Complex. 26 (2019)
Ran Raz
Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. J. ACM 66 (1) (2019)
Yael Tauman Kalai, Ilan Komargodski, Ran Raz
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. DISC (2018)
Sumegha Garg, Ran Raz, Avishay Tal
Extractor-based time-space lower bounds for learning. STOC (2018)
Mark Braverman, Anat Ganor, Gillat Kol, Ran Raz
A Candidate for a Strong Separation of Information and Communication. ITCS (2018)
Ran Raz, Avishay Tal
Oracle Separation of BQP and PH. Electron. Colloquium Comput. Complex. 25 (2018)
Ilan Komargodski, Ran Raz, Yael Tauman Kalai
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. Electron. Colloquium Comput. Complex. 25 (2018)
Sumegha Garg, Ran Raz, Avishay Tal
Extractor-Based Time-Space Lower Bounds for Learning. Electron. Colloquium Comput. Complex. 24 (2017)
Ran Raz
A Time-Space Lower Bound for a Large Class of Learning Problems. Electron. Colloquium Comput. Complex. 24 (2017)
Ilan Komargodski, Ran Raz, Avishay Tal
Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound. SIAM J. Comput. 46 (1) (2017)
Sumegha Garg, Ran Raz, Avishay Tal
Extractor-Based Time-Space Lower Bounds for Learning. CoRR (2017)
Ran Raz
A Time-Space Lower Bound for a Large Class of Learning Problems. FOCS (2017)
Gillat Kol, Ran Raz, Avishay Tal
Time-space hardness of learning sparse parities. STOC (2017)
Ran Raz
Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. Electron. Colloquium Comput. Complex. 23 (2016)
Anat Ganor, Gillat Kol, Ran Raz
Exponential Separation of Information and Communication for Boolean Functions. J. ACM 63 (5) (2016)
Michael Dinitz, Guy Kortsarz, Ran Raz
-Spanner. ACM Trans. Algorithms 12 (2) (2016)
Ran Raz
Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. FOCS (2016)
Ran Raz
Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. IACR Cryptol. ePrint Arch. 2016 (2016)
Gillat Kol, Ran Raz, Avishay Tal
Time-Space Hardness of Learning Sparse Parities. Electron. Colloquium Comput. Complex. 23 (2016)
Gillat Kol, Ran Raz
Bounds on 2-query Locally Testable Codes with affine tests. Inf. Process. Lett. 116 (8) (2016)
Yael Tauman Kalai, Ran Raz, Oded Regev
On the Space Complexity of Linear Programming with Preprocessing. ITCS (2016)
Ran Raz
Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. CoRR (2016)
Anat Ganor, Gillat Kol, Ran Raz
Exponential separation of communication and external information. STOC (2016)
Anat Ganor, Gillat Kol, Ran Raz
Exponential Separation of Communication and External Information. Electron. Colloquium Comput. Complex. 22 (2015)
Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
Welfare Maximization with Limited Interaction. FOCS (2015)
Anat Ganor, Gillat Kol, Ran Raz
Exponential Separation of Information and Communication for Boolean Functions. STOC (2015)
Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
Welfare Maximization with Limited Interaction. CoRR (2015)
Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
Welfare Maximization with Limited Interaction. Electron. Colloquium Comput. Complex. 22 (2015)
Tom Gur, Ran Raz
Arthur-Merlin streaming complexity. Inf. Comput. 243 (2015)
Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
Pseudorandom Generators for Regular Branching Programs. SIAM J. Comput. 43 (3) (2014)
Anat Ganor, Gillat Kol, Ran Raz
Exponential Separation of Information and Communication for Boolean Functions. Electron. Colloquium Comput. Complex. 21 (2014)
Yael Tauman Kalai, Ran Raz, Ron D. Rothblum
How to delegate computations: the power of no-signaling proofs. STOC (2014)
Gil Cohen, Anat Ganor, Ran Raz
Two Sides of the Coin Problem. APPROX-RANDOM (2014)
Anat Ganor, Gillat Kol, Ran Raz
Exponential Separation of Information and Communication. Electron. Colloquium Comput. Complex. 21 (2014)
Gillat Kol, Ran Raz
Competing-Provers Protocols for Circuit Evaluation. Theory Comput. 10 (2014)
Anat Ganor, Gillat Kol, Ran Raz
Exponential Separation of Information and Communication. FOCS (2014)
Yael Tauman Kalai, Ran Raz
On the Space Complexity of Linear Programming with Preprocessing. Electron. Colloquium Comput. Complex. 21 (2014)
Gil Cohen, Ran Raz, Gil Segev
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification. SIAM J. Comput. 43 (2) (2014)
Gil Cohen, Anat Ganor, Ran Raz
Two Sides of the Coin Problem. Electron. Colloquium Comput. Complex. 21 (2014)
Anat Ganor, Ran Raz
Space Pseudorandom Generators by Communication Complexity Lower Bounds. APPROX-RANDOM (2014)
Tom Gur, Ran Raz
Arthur-Merlin Streaming Complexity. ICALP (1) (2013)
Gillat Kol, Ran Raz
Competing provers protocols for circuit evaluation. ITCS (2013)
Gillat Kol, Ran Raz
Interactive Channel Capacity. Electron. Colloquium Comput. Complex. 20 (2013)
Ran Raz
Tensor-Rank and Lower Bounds for Arithmetic Formulas. J. ACM 60 (6) (2013)
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). CRYPTO (2) (2013)
Ilan Komargodski, Ran Raz
Average-case lower bounds for formula size. STOC (2013)
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron Rothblum
Efficient Multiparty Protocols via Log-Depth Threshold Formulae. Electron. Colloquium Comput. Complex. 20 (2013)

Ran Raz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ran Raz