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

Lower Bounds for Approximating Graph Parameters via Communication Complexity., and . CoRR, (2017)Training-Time Attacks against k-Nearest Neighbors., , and . CoRR, (2022)Fault Tolerant Gradient Clock Synchronization., , and . PODC, page 357-365. ACM, (2019)Stable Matchings with Restricted Preferences: Structure and Complexity., and . ACM Trans. Economics and Comput., 10 (3): 13:1-13:45 (September 2022)Stable Matchings with Restricted Preferences: Structure and Complexity., and . EC, page 319-339. ACM, (2021)Packet Forwarding with Swaps., and . SIROCCO, volume 13892 of Lecture Notes in Computer Science, page 536-557. Springer, (2023)The Arboricity Captures the Complexity of Sampling Edges., , and . ICALP, volume 132 of LIPIcs, page 52:1-52:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Packet Forwarding with a Locally Bursty Adversary.. DISC, volume 246 of LIPIcs, page 34:1-34:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Space-Optimal Packet Routing on Trees., and . INFOCOM, page 1036-1044. IEEE, (2019)Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting., , and . CoRR, (2020)