Uma Girish

Orcid: 0000-0003-3055-9406

According to our database1, Uma Girish authored at least 21 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Magic and communication complexity.
CoRR, October, 2025

Fourier Spectrum of Noisy Quantum Algorithms.
CoRR, October, 2025

Comparing classical and quantum conditional disclosure of secrets.
IACR Cryptol. ePrint Arch., 2025

Forrelation is Extremally Hard.
Electron. Colloquium Comput. Complex., 2025

2024
Quantum versus Classical Communication and Query Complexity
PhD thesis, 2024

The Power of Adaptivity in Quantum Query Algorithms.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Quantum Logspace Computations are Verifiable.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023
Trade-offs between Entanglement and Communication.
Electron. Colloquium Comput. Complex., 2023

One Clean Qubit Suffices for Quantum Communication Advantage.
Electron. Colloquium Comput. Complex., 2023

Is Untrusted Randomness Helpful?
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Fourier Growth of Communication Protocols for XOR Functions.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Trade-Offs Between Entanglement and Communication.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Parallel repetition for all 3-player games over binary alphabet.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Eliminating Intermediate Measurements Using Pseudorandom Generators.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs.
Proceedings of the Approximation, 2022

2021
A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof.
Electron. Colloquium Comput. Complex., 2021

Quantum Versus Randomized Communication Complexity, with Efficient Players.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Quantum Logspace Algorithm for Powering Matrices with Bounded Norm.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Fourier Growth of Parity Decision Trees.
Proceedings of the 36th Computational Complexity Conference, 2021

Lower Bounds for XOR of Forrelations.
Proceedings of the Approximation, 2021

Parallel Repetition for the GHZ Game: A Simpler Proof.
Proceedings of the Approximation, 2021


  Loading...