Author of the publication

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract.

, and . FOCS, page 240-246. IEEE, (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.

 

Other publications of authors with the same name

Learning and Testing Junta Distributions., , and . COLT, volume 49 of JMLR Workshop and Conference Proceedings, page 19-46. JMLR.org, (2016)Box Covers and Domain Orderings for Beyond Worst-Case Join Processing., , and . ICDT, volume 186 of LIPIcs, page 3:1-3:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Approximating Boolean Functions with Depth-2 Circuits., and . CCC, page 74-85. IEEE Computer Society, (2013)Lower Bounds for Testing Function Isomorphism., and . CCC, page 235-246. IEEE Computer Society, (2010)The Information Complexity of Hamming Distance., , and . APPROX-RANDOM, volume 28 of LIPIcs, page 465-489. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Partially Symmetric Functions Are Efficiently Isomorphism-Testable., , and . FOCS, page 551-560. IEEE Computer Society, (2012)VC dimension and distribution-free sample-based testing., , and . STOC, page 504-517. ACM, (2021)Improved Bounds for Testing Juntas.. APPROX-RANDOM, volume 5171 of Lecture Notes in Computer Science, page 317-330. Springer, (2008)On DNF Approximators for Monotone Boolean Functions., , , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 235-246. Springer, (2014)Testing convexity of functions over finite domains., , and . SODA, page 2030-2045. SIAM, (2020)