Ran Raz
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS3 editions2021–2023
on a stage with
- Uma Girish3×
- Avishay Talonce
- Kunal Mittalonce
all 4 in the filters
who talks about the same things
- Uma Girish4 talks
- Avishay Tal4 talks
- Yuval Filmus9 talks
- Gillat Kol5 talks
- Prahladh Harsha4 talks
- Mark Braverman5 talks
| title | conference | date |
|---|---|---|
| Is Untrusted Randomness Helpful? | ITCS 2023 | 2023-01-10 |
Defines a model where an algorithm gets many adversarial untrusted random bits plus k truly random bits and may output 0,1 or "I don't know", formalized as… | ||
| Eliminating Intermediate Measurements using Pseudorandom Generators | ITCS 2022 | 2022-01-31 |
Proves that any quantum circuit with intermediate measurements, time T and space S, simulates to a measurement-free circuit in time T poly S and space S log T… | ||
| Quantum versus Randomized Communication Complexity, with Efficient Players | ITCS 2021 | 2021-01-06 |
Shows a concrete partial function (a XOR lift of Aaronson’s Fourrelation) that has an efficient small-cost quantum simultaneous protocol with a few EPR pairs… | ||
| Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing | ITCS 2021 | 2021-01-06 |
Claims that a strong multiplayer parallel-repetition theorem (conjectured decay Val(G^n) ≤ 2^{-Ω(KN)} for the independent K-player function game) yields… | ||
| Tutorial on Capacity in Coding for Interactive Communication (Part 1 of 2) | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Ran Raz, Weizmann Institute and Institute for Advanced Study
Information Theory in Complexity Theory and… | ||
| How to Delegate Computations: The Power of No-Signaling Proofs | Quantum Games and Protocols | 2014-02-24 |
Gives a concrete one-round delegation protocol that lets a weak verifier check any function f computable in time t: prover runs in poly(t), verifier runs in n… | ||
| nothing matches | ||