Author of the publication

Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set.

, , , and . PODC, page 283-285. ACM, (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

Improved Distributed Approximations for Maximum Independent Set., , , and . DISC, volume 179 of LIPIcs, page 35:1-35:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Constant-Round Spanners and Shortest Paths in Congested Clique and MPC., , , and . PODC, page 223-233. ACM, (2021)On the Communication Complexity of Secure Multi-Party Computation With Aborts., , , , and . CoRR, (2024)A Composition-Based Method for Combinatorial Test Design., , , and . ICST Workshops, page 249-252. IEEE Computer Society, (2017)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond., , , and . STOC, page 1487-1500. ACM, (2022)Listing 4-Cycles., , , and . FSTTCS, volume 284 of LIPIcs, page 25:1-25:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set., , , and . PODC, page 283-285. ACM, (2020)Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST., , and . PODC, page 511-520. ACM, (2020)Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model., , and . DISC, volume 91 of LIPIcs, page 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks., , and . DISC, volume 9888 of Lecture Notes in Computer Science, page 29-42. Springer, (2016)