default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUma Girish
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j2]Uma Girish, Alex May
, Leo Orshansky, Chris Waddell:
Comparing classical and quantum conditional disclosure of secrets. Quantum 10: 2049 (2026)- [c16]Uma Girish, Rocco A. Servedio:
Forrelation Is Extremally Hard. ITCS 2026: 72:1-72:22 - [c15]Uma Girish:
Fourier Spectrum of Noisy Quantum Algorithms. STOC 2026: 305-313 - [c14]Uma Girish, Alex May, Natalie Parham, Henry Yuen:
Magic and Communication Complexity. STOC 2026: 845-856 - [i30]Uma Girish, Grzegorz Gluch, Shafi Goldwasser, Tal Malkin, Leo Orshansky, Henry Yuen:
Private Proofs of When and Where. IACR Cryptol. ePrint Arch. 2026: 136 (2026) - 2025
- [i29]Uma Girish:
Fourier Spectrum of Noisy Quantum Algorithms. CoRR abs/2510.06385 (2025) - [i28]Uma Girish, Alex May, Natalie Parham, Henry Yuen:
Magic and communication complexity. CoRR abs/2510.07246 (2025) - [i27]Uma Girish:
Fourier Spectrum of Noisy Quantum Algorithms. Electron. Colloquium Comput. Complex. TR25: Article TR25-154 (2025) - [i26]Uma Girish, Rocco A. Servedio:
Forrelation is Extremally Hard. Electron. Colloquium Comput. Complex. TR25: Article TR25-117 (2025) - [i25]Uma Girish, Alex May, Leo Orshansky, Chris Waddell:
Comparing classical and quantum conditional disclosure of secrets. IACR Cryptol. ePrint Arch. 2025: 800 (2025) - 2024
- [b1]Uma Girish:
Quantum versus Classical Communication and Query Complexity. Princeton University, USA, 2024 - [c13]Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Computations are Verifiable. SOSA 2024: 144-150 - [c12]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
The Power of Adaptivity in Quantum Query Algorithms. STOC 2024: 1488-1497 - 2023
- [c11]Srinivasan Arunachalam, Uma Girish:
Trade-Offs Between Entanglement and Communication. CCC 2023: 25:1-25:23 - [c10]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
Fourier Growth of Communication Protocols for XOR Functions. FOCS 2023: 721-732 - [c9]Uma Girish, Ran Raz, Wei Zhan:
Is Untrusted Randomness Helpful? ITCS 2023: 56:1-56:18 - [i24]Srinivasan Arunachalam, Uma Girish:
Trade-offs between Entanglement and Communication. CoRR abs/2306.01233 (2023) - [i23]Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Computations are Verifiable. CoRR abs/2307.11083 (2023) - [i22]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
Fourier Growth of Communication Protocols for XOR Functions. CoRR abs/2307.13926 (2023) - [i21]Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. CoRR abs/2310.02406 (2023) - [i20]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
The Power of Adaptivity in Quantum Query Algorithms. CoRR abs/2311.16057 (2023) - [i19]Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. Electron. Colloquium Comput. Complex. TR23: Article TR23-148 (2023) - [i18]Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Computations are Verifiable. Electron. Colloquium Comput. Complex. TR23: Article TR23-107 (2023) - [i17]A. Srinivasan, Uma Girish:
Trade-offs between Entanglement and Communication. Electron. Colloquium Comput. Complex. TR23: Article TR23-083 (2023) - 2022
- [j1]Uma Girish, Ran Raz, Avishay Tal:
Quantum versus Randomized Communication Complexity, with Efficient Players. Comput. Complex. 31(2): 17 (2022) - [c8]Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan:
Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs. APPROX/RANDOM 2022: 6:1-6:17 - [c7]Uma Girish, Ran Raz:
Eliminating Intermediate Measurements Using Pseudorandom Generators. ITCS 2022: 76:1-76:18 - [c6]Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel repetition for all 3-player games over binary alphabet. STOC 2022: 998-1009 - [i16]Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR abs/2202.06826 (2022) - [i15]Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan:
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. CoRR abs/2204.00858 (2022) - [i14]Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition For All 3-Player Games Over Binary Alphabet. Electron. Colloquium Comput. Complex. TR22: Article TR22-039 (2022) - [i13]Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan:
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. Electron. Colloquium Comput. Complex. TR22: Article TR22-043 (2022) - 2021
- [c5]Uma Girish, Ran Raz, Wei Zhan:
Lower Bounds for XOR of Forrelations. APPROX-RANDOM 2021: 52:1-52:14 - [c4]Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition for the GHZ Game: A Simpler Proof. APPROX-RANDOM 2021: 62:1-62:19 - [c3]Uma Girish, Avishay Tal, Kewen Wu:
Fourier Growth of Parity Decision Trees. CCC 2021: 39:1-39:36 - [c2]Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. ICALP 2021: 73:1-73:20 - [c1]Uma Girish, Ran Raz, Avishay Tal:
Quantum Versus Randomized Communication Complexity, with Efficient Players. ITCS 2021: 54:1-54:20 - [i12]Uma Girish, Avishay Tal, Kewen Wu:
Fourier Growth of Parity Decision Trees. CoRR abs/2103.11604 (2021) - [i11]Uma Girish, Ran Raz:
Eliminating Intermediate Measurements using Pseudorandom Generators. CoRR abs/2106.11877 (2021) - [i10]Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition for the GHZ Game: A Simpler Proof. CoRR abs/2107.06156 (2021) - [i9]Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof. Electron. Colloquium Comput. Complex. TR21: Article TR21-101 (2021) - [i8]Uma Girish, Ran Raz:
Eliminating Intermediate Measurements using Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR21: Article TR21-087 (2021) - [i7]Uma Girish, Avishay Tal, Kewen Wu:
Fourier Growth of Parity Decision Trees. Electron. Colloquium Comput. Complex. TR21: Article TR21-046 (2021) - 2020
- [i6]Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. CoRR abs/2006.04880 (2020) - [i5]Uma Girish, Ran Raz, Wei Zhan:
Lower Bounds for XOR of Forrelations. CoRR abs/2007.03631 (2020) - [i4]Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. Electron. Colloquium Comput. Complex. TR20: Article TR20-087 (2020) - [i3]Uma Girish, Ran Raz, Wei Zhan:
Lower Bounds for XOR of Forrelations. Electron. Colloquium Comput. Complex. TR20: Article TR20-101 (2020)
2010 – 2019
- 2019
- [i2]Uma Girish, Ran Raz, Avishay Tal:
Quantum versus Randomized Communication Complexity, with Efficient Players. CoRR abs/1911.02218 (2019) - [i1]Uma Girish, Ran Raz, Avishay Tal:
Quantum versus Randomized Communication Complexity, with Efficient Players. Electron. Colloquium Comput. Complex. TR19: Article TR19-152 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-11 23:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
