Uma Girish

Orcid: 0000-0003-3055-9406

According to our database1, Uma Girish authored at least 16 papers between 2020 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Quantum Logspace Computations are Verifiable.
Electron. Colloquium Comput. Complex., 2023

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

The Power of Adaptivity in Quantum Query Algorithms.
CoRR, 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
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs.
Electron. Colloquium Comput. Complex., 2022

Parallel Repetition For All 3-Player Games Over Binary Alphabet.
Electron. Colloquium Comput. Complex., 2022

Quantum versus Randomized Communication Complexity, with Efficient Players.
Comput. Complex., 2022

2021
Fourier Growth of Parity Decision Trees.
Electron. Colloquium Comput. Complex., 2021

Eliminating Intermediate Measurements using Pseudorandom Generators.
Electron. Colloquium Comput. Complex., 2021

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

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

2020
Lower Bounds for XOR of Forrelations.
Electron. Colloquium Comput. Complex., 2020

Quantum Logspace Algorithm for Powering Matrices with Bounded Norm.
Electron. Colloquium Comput. Complex., 2020


  Loading...