Author of the publication

On the Multiparty Communication Complexity of Testing Triangle-Freeness.

, , and . PODC, page 111-120. ACM, (2017)

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

A distributed algorithm for directed minimum-weight spanning tree., and . Distributed Comput., 36 (1): 57-87 (March 2023)Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles., , , , and . DISC, volume 146 of LIPIcs, page 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Interactive Capacity of Finite-State Protocols., , , and . CoRR, (2020)On the Communication Complexity of Key-Agreement Protocols., , , , and . ITCS, volume 124 of LIPIcs, page 40:1-40:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Massively Parallel Computation in a Heterogeneous Regime., , and . PODC, page 345-355. ACM, (2022)On Polynomial Time Local Decision., and . OPODIS, volume 286 of LIPIcs, page 27:1-27:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Truthful Information Dissemination in General Asynchronous Networks., and . DISC, volume 209 of LIPIcs, page 37:1-37:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On Distributed Merlin-Arthur Decision Protocols., , , , and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 230-245. Springer, (2019)Public vs. private randomness in simultaneous multi-party communication complexity., , and . Theor. Comput. Sci., (2020)Superlinear Lower Bounds for Distributed Subgraph Detection., , and . CoRR, (2017)