Author of the publication

Symmetry and Quantum Query-To-Communication Simulation.

, , , , , and . STACS, volume 219 of LIPIcs, page 20:1-20:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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. 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

Randomized versus Deterministic Decision Tree Size., , , , and . STOC, page 867-880. ACM, (2023)The log-approximate-rank conjecture is false., , and . STOC, page 42-53. ACM, (2019)Separation of Unbounded-Error Models in Multi-Party Communication Complexity., and . Theory of Computing, 14 (1): 1-23 (2018)Quantum Sabotage Complexity., , and . CoRR, (2024)Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead., , , and . Electron. Colloquium Comput. Complex., (2019)Symmetry and Quantum Query-To-Communication Simulation., , , , , and . STACS, volume 219 of LIPIcs, page 20:1-20:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)One-Way Communication Complexity and Non-Adaptive Decision Trees., , and . STACS, volume 219 of LIPIcs, page 49:1-49:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Improved Approximate Degree Bounds for k-Distinctness., , and . TQC, volume 158 of LIPIcs, page 2:1-2:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Lifting Theorem with Applications to Symmetric Functions., and . FSTTCS, volume 93 of LIPIcs, page 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Symmetry and Quantum Query-to-Communication Simulation., , , , , and . CoRR, (2020)