Uma Girish
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
- Ran Raz3×
- Avishay Talonce
- Wei Zhanonce
who talks about the same things
- Ran Raz6 talks
- Avishay Tal4 talks
- Prahladh Harsha4 talks
- Emanuele Viola7 talks
- Yuval Filmus9 talks
- Shuichi Hirahara7 talks
| title | conference | date |
|---|---|---|
| Fourier Growth of XOR-Fibers of Communication Protocols | Structural Results 2023 | 2023-07-20 |
Proves a tight O(sqrt{d}) bound for level‑1 Fourier growth of XOR‑fibers and an improved O(d^{3/2}) bound for level‑2, conjecturing an optimal O(d · polylog n)… | ||
| 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… | ||
| nothing matches | ||