Author of the publication

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Quantum versus Randomized Communication Complexity, with Efficient Players., , and . Electron. Colloquium Comput. Complex., (2019)Quantum Logspace Computations are Verifiable., , and . CoRR, (2023)Fourier Growth of Communication Protocols for XOR Functions., , , and . FOCS, page 721-732. IEEE, (2023)Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs., , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Quantum Logspace Computations are Verifiable., , and . SOSA, page 144-150. SIAM, (2024)Quantum Logspace Algorithm for Powering Matrices with Bounded Norm., , and . Electron. Colloquium Comput. Complex., (2020)Eliminating Intermediate Measurements using Pseudorandom Generators., and . CoRR, (2021)One Clean Qubit Suffices for Quantum Communication Advantage., , and . CoRR, (2023)Is Untrusted Randomness Helpful?, , and . ITCS, volume 251 of LIPIcs, page 56:1-56:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Quantum Versus Randomized Communication Complexity, with Efficient Players., , and . ITCS, volume 185 of LIPIcs, page 54:1-54:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)