Author of the publication

A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds.

, , and . PODC, page 3-8. ACM, (2016)

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

Derandomizing Local Distributed Algorithms under Bandwidth Restrictions., , and . CoRR, (2016)Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks., , , , and . CoRR, (2019)Adapting Local Sequential Algorithms to the Distributed Setting., and . DISC, volume 121 of LIPIcs, page 35:1-35:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)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)Optimal distributed covering algorithms., , , and . Distributed Comput., 36 (1): 45-55 (March 2023)Finding Subgraphs in Highly Dynamic Networks., , and . CoRR, (2020)A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds., , , and . CoRR, (2018)A (2+ε)-Approximation for Maximum Weight Matching in the Semi-Streaming Model., and . CoRR, (2017)Smoothed Analysis of Population Protocols., and . DISC, volume 209 of LIPIcs, page 34:1-34:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fast Deterministic Algorithms for Highly-Dynamic Networks., , , , and . OPODIS, volume 184 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)