Uma Girish - RankMe

47 papers A* 4A 7Journal 32Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Comparing classical and quantum conditional disclosure of secrets. Quantum Uma Girish, Alex May, Leo Orshansky, Chris Waddell
2026	A	`conf`	Forrelation Is Extremally Hard. ITCS Uma Girish, Rocco A. Servedio
2026	J	`jnl`	Private Proofs of When and Where. IACR Cryptol. ePrint Arch. Uma Girish, Grzegorz Gluch, Shafi Goldwasser, Tal Malkin, Leo Orshansky, Henry Yuen
2025	J	`jnl`	Comparing classical and quantum conditional disclosure of secrets. IACR Cryptol. ePrint Arch. Uma Girish, Alex May, Leo Orshansky, Chris Waddell
2025	J	`jnl`	Forrelation is Extremally Hard. Electron. Colloquium Comput. Complex. Uma Girish, Rocco A. Servedio
2025	J	`jnl`	Fourier Spectrum of Noisy Quantum Algorithms. CoRR Uma Girish
2025	J	`jnl`	Fourier Spectrum of Noisy Quantum Algorithms. Electron. Colloquium Comput. Complex. Uma Girish
2025	J	`jnl`	Magic and communication complexity. CoRR Uma Girish, Alex May, Natalie Parham, Henry Yuen
2024	—	`conf`	Quantum Logspace Computations are Verifiable. SOSA Uma Girish, Ran Raz, Wei Zhan
2024	—	`—`	Quantum versus Classical Communication and Query Complexity Uma Girish
2024	A*	`conf`	The Power of Adaptivity in Quantum Query Algorithms. STOC Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
2023	A*	`conf`	Fourier Growth of Communication Protocols for XOR Functions. FOCS Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
2023	J	`jnl`	Fourier Growth of Communication Protocols for XOR Functions. CoRR Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
2023	A	`conf`	Is Untrusted Randomness Helpful? ITCS Uma Girish, Ran Raz, Wei Zhan
2023	J	`jnl`	One Clean Qubit Suffices for Quantum Communication Advantage. CoRR Srinivasan Arunachalam, Uma Girish, Noam Lifshitz
2023	J	`jnl`	One Clean Qubit Suffices for Quantum Communication Advantage. Electron. Colloquium Comput. Complex. Srinivasan Arunachalam, Uma Girish, Noam Lifshitz
2023	J	`jnl`	Quantum Logspace Computations are Verifiable. CoRR Uma Girish, Ran Raz, Wei Zhan
2023	J	`jnl`	Quantum Logspace Computations are Verifiable. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz, Wei Zhan
2023	J	`jnl`	The Power of Adaptivity in Quantum Query Algorithms. CoRR Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
2023	A	`conf`	Trade-Offs Between Entanglement and Communication. CCC Srinivasan Arunachalam, Uma Girish
2023	J	`jnl`	Trade-offs between Entanglement and Communication. CoRR Srinivasan Arunachalam, Uma Girish
2023	J	`jnl`	Trade-offs between Entanglement and Communication. Electron. Colloquium Comput. Complex. A. Srinivasan, Uma Girish
2022	A	`conf`	Eliminating Intermediate Measurements Using Pseudorandom Generators. ITCS Uma Girish, Ran Raz
2022	J	`jnl`	Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2022	J	`jnl`	Parallel Repetition For All 3-Player Games Over Binary Alphabet. Electron. Colloquium Comput. Complex. Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2022	A*	`conf`	Parallel repetition for all 3-player games over binary alphabet. STOC Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2022	J	`jnl`	Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. CoRR Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
2022	J	`jnl`	Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. Electron. Colloquium Comput. Complex. Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
2022	A	`conf`	Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs. APPROX/RANDOM Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
2022	J	`jnl`	Quantum versus Randomized Communication Complexity, with Efficient Players. Comput. Complex. Uma Girish, Ran Raz, Avishay Tal
2021	J	`jnl`	A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof. Electron. Colloquium Comput. Complex. Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2021	J	`jnl`	Eliminating Intermediate Measurements using Pseudorandom Generators. CoRR Uma Girish, Ran Raz
2021	J	`jnl`	Eliminating Intermediate Measurements using Pseudorandom Generators. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz
2021	A	`conf`	Fourier Growth of Parity Decision Trees. CCC Uma Girish, Avishay Tal, Kewen Wu
2021	J	`jnl`	Fourier Growth of Parity Decision Trees. CoRR Uma Girish, Avishay Tal, Kewen Wu
2021	J	`jnl`	Fourier Growth of Parity Decision Trees. Electron. Colloquium Comput. Complex. Uma Girish, Avishay Tal, Kewen Wu
2021	—	`conf`	Lower Bounds for XOR of Forrelations. APPROX-RANDOM Uma Girish, Ran Raz, Wei Zhan
2021	—	`conf`	Parallel Repetition for the GHZ Game: A Simpler Proof. APPROX-RANDOM Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2021	J	`jnl`	Parallel Repetition for the GHZ Game: A Simpler Proof. CoRR Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2021	A*	`conf`	Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. ICALP Uma Girish, Ran Raz, Wei Zhan
2021	A	`conf`	Quantum Versus Randomized Communication Complexity, with Efficient Players. ITCS Uma Girish, Ran Raz, Avishay Tal
2020	J	`jnl`	Lower Bounds for XOR of Forrelations. CoRR Uma Girish, Ran Raz, Wei Zhan
2020	J	`jnl`	Lower Bounds for XOR of Forrelations. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz, Wei Zhan
2020	J	`jnl`	Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. CoRR Uma Girish, Ran Raz, Wei Zhan
2020	J	`jnl`	Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz, Wei Zhan
2019	J	`jnl`	Quantum versus Randomized Communication Complexity, with Efficient Players. CoRR Uma Girish, Ran Raz, Avishay Tal
2019	J	`jnl`	Quantum versus Randomized Communication Complexity, with Efficient Players. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz, Avishay Tal