E-LIB Suche - Ergebnisse für: Raz, Ran

1

On the works of Avi Wigderson:

, In: The Abel Prize 2018-2022; The Abel Prize,

Barak, Boaz ; Kalai, Yael ; Raz, Ran.. - p. 595-705 , 2024

Link: https://doi.org/10.1007/..

2

Certified Hardness vs. Randomness for Log-Space:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Pyne, Edward ; Raz, Ran ; Zhan, Wei - p. 989-1007 , 2023

Link: https://doi.org/10.1109/..

3

Memory-Sample Lower Bounds for Learning with Classical-Quan..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Liu, Qipeng ; Raz, Ran ; Zhan, Wei - p. 1097-1110 , 2023

Link: https://dl.acm.org/doi/1..

4

Oracle Separation of BQP and PH:

Raz, Ran ; Tal, Avishay
Journal of the ACM. 69 (2022) 4 - p. 1-21 , 2022

Link: https://doi.org/10.1145/..

5

Parallel repetition for all 3-player games over binary alph..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,

Girish, Uma ; Holmgren, Justin ; Mittal, Kunal.. - p. 998-1009 , 2022

Link: https://dl.acm.org/doi/1..

6

Quantum versus Randomized Communication Complexity, with Ef..:

Girish, Uma ; Raz, Ran ; Tal, Avishay
computational complexity. 31 (2022) 2 - p. , 2022

Link: https://doi.org/10.1007/..

7

How to Delegate Computations: The Power of No-Signaling Pro..:

Kalai, Yael Tauman ; Raz, Ran ; Rothblum, Ron D.
ACM Journal of the ACM (JACM). 69 (2021) 1 - p. 1-82 , 2021

Link: https://dl.acm.org/doi/1..

8

How to Delegate Computations: The Power of No-Signaling Pro..:

Kalai, Yael Tauman ; Raz, Ran ; Rothblum, Ron D.
Journal of the ACM. 69 (2021) 1 - p. 1-82 , 2021

Link: https://doi.org/10.1145/..

9

A Lower Bound for Adaptively-Secure Collective Coin Flippin..:

Kalai, Yael Tauman ; Komargodski, Ilan ; Raz, Ran
Combinatorica. 41 (2020) 1 - p. 75-98 , 2020

Link: https://doi.org/10.1007/..

10

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Al..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),

Assadi, Sepehr ; Raz, Ran - p. 342-353 , 2020

Link: https://doi.org/10.1109/..

11

Time-space lower bounds for two-pass learning:

, In: Proceedings of the 34th Computational Complexity Conference,

Garg, Sumegha ; Raz, Ran ; Tal, Avishay - p. 1-39 , 2019

Link: https://dl.acm.org/doi/1..

12

Exponential Separation of Communication and External Inform..:

Ganor, Anat ; Kol, Gillat ; Raz, Ran
SIAM Journal on Computing. 50 (2019) 3 - p. STOC16-236-STOC16-254 , 2019

Link: https://doi.org/10.1137/..

13

Oracle separation of BQP and PH:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,

Raz, Ran ; Tal, Avishay - p. 13-23 , 2019

Link: https://dl.acm.org/doi/1..

14

Fast Learning Requires Good Memory: A Time-Space Lower Boun..:

Raz, Ran
Journal of the ACM. 66 (2018) 1 - p. 1-18 , 2018

Link: https://doi.org/10.1145/..

15

Extractor-based time-space lower bounds for learning:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,

Garg, Sumegha ; Raz, Ran ; Tal, Avishay - p. 990-1002 , 2018

Link: https://dl.acm.org/doi/1..