( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parallel repetition for all 3-player games over binary alphabet.

, , , , и . STOC, стр. 998-1009. ACM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Uma Srinivasan

Venkatarama Umamaheswaran

Uma Jayachandran

Uma Keller

Girish Sharma

 

Другие публикации лиц с тем же именем

Fourier Growth of Communication Protocols for XOR Functions., , , и . FOCS, стр. 721-732. IEEE, (2023)Quantum Logspace Computations are Verifiable., , и . SOSA, стр. 144-150. SIAM, (2024)Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs., , , и . APPROX/RANDOM, том 245 из LIPIcs, стр. 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)One Clean Qubit Suffices for Quantum Communication Advantage., , и . CoRR, (2023)Eliminating Intermediate Measurements using Pseudorandom Generators., и . CoRR, (2021)The Power of Adaptivity in Quantum Query Algorithms., , , и . STOC, стр. 1488-1497. ACM, (2024)Quantum Logspace Algorithm for Powering Matrices with Bounded Norm., , и . ICALP, том 198 из LIPIcs, стр. 73:1-73:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Is Untrusted Randomness Helpful?, , и . ITCS, том 251 из LIPIcs, стр. 56:1-56:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Quantum Versus Randomized Communication Complexity, with Efficient Players., , и . ITCS, том 185 из LIPIcs, стр. 54:1-54:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Lower Bounds for XOR of Forrelations., , и . Electron. Colloquium Comput. Complex., (2020)