( en | de | ru )

 

Disambiguation of "Ben-David, Shalev"

Author of the publication

copydeleteadd this publication to your clipboard
When Is Amplification Necessary for Composition in Randomized Query Complexity?

, , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Shalev Ben-David

Shoham Ben-David

Josef Shalev

David Ben Titus Santosa

Ben Elsner

 

Other publications of authors with the same name

Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge., and . TQC, volume 135 of LIPIcs, page 2:1-2:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem., , , , and . STOC, page 1330-1342. ACM, (2021)Symmetries, Graph Properties, and Quantum Speedups., , , , , and . FOCS, page 649-660. IEEE, (2020)A New Minimax Theorem for Randomized Algorithms, and . (2020)cite arxiv:2002.10802Comment: 57 pages.A New Minimax Theorem for Randomized Algorithms., and . J. ACM, 70 (6): 38:1-38:58 (December 2023)Quantum Implications of Huang's Sensitivity Theorem., , , and . CoRR, (2020)A New Minimax Theorem for Randomized Algorithms (Extended Abstract)., and . FOCS, page 403-411. IEEE, (2020)A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract., and . FOCS, page 240-246. IEEE, (2020)On Query-To-Communication Lifting for Adversary Bounds., , and . CCC, volume 200 of LIPIcs, page 30:1-30:39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On Query-to-Communication Lifting for Adversary Bounds., , and . CoRR, (2020)