From post

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.

 

Другие публикации лиц с тем же именем

Optimal Adjacency Labels for Subgraphs of Cartesian Products., , и . ICALP, том 261 из LIPIcs, стр. 57:1-57:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Sketching Distances in Monotone Graph Classes., , и . APPROX/RANDOM, том 245 из LIPIcs, стр. 18:1-18:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Randomized Communication and the Implicit Graph Conjecture., , и . CoRR, (2021)Optimal Adjacency Labels for Subgraphs of Cartesian Products., , и . SIAM J. Discret. Math., 38 (3): 2181-2193 (2024)Randomized communication and implicit graph representations., , и . STOC, стр. 1220-1233. ACM, (2022)Testing Juntas Optimally with Samples., , и . CoRR, (мая 2025)Graphs with minimum fractional domatic number., , , и . Discret. Appl. Math., (января 2024)Testing and Learning Convex Sets in the Ternary Hypercube., , и . ITCS, том 287 из LIPIcs, стр. 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)VC dimension and distribution-free sample-based testing., , и . STOC, стр. 504-517. ACM, (2021)Constant-Cost Communication is not Reducible to k-Hamming Distance., , , и . CoRR, (2024)