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

VC dimension and distribution-free sample-based testing., , and . STOC, page 504-517. ACM, (2021)Testing Support Size More Efficiently Than Learning Histograms., and . CoRR, (2024)Better Boosting of Communication Oracles, or Not., and . FSTTCS, volume 323 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Constant-Cost Communication is not Reducible to k-Hamming Distance., , , and . CoRR, (2024)Randomized communication and implicit graph representations., , and . STOC, page 1220-1233. ACM, (2022)Optimal Adjacency Labels for Subgraphs of Cartesian Products., , and . ICALP, volume 261 of LIPIcs, page 57:1-57:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Sketching Distances in Monotone Graph Classes., , and . APPROX/RANDOM, volume 245 of LIPIcs, page 18:1-18:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Randomized Communication and the Implicit Graph Conjecture., , and . CoRR, (2021)Optimal Adjacency Labels for Subgraphs of Cartesian Products., , and . SIAM J. Discret. Math., 38 (3): 2181-2193 (2024)Testing and Learning Convex Sets in the Ternary Hypercube., , and . ITCS, volume 287 of LIPIcs, page 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)