Author of the publication

Counting-based impossibility proofs for set agreement and renaming.

, and . J. Parallel Distributed Comput., (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

A Topological Perspective on Distributed Network Algorithms., , , , , and . CoRR, (2019)Algebraic methods in the congested clique., , , , , and . Distributed Comput., 32 (6): 461-478 (2019)Counting-based impossibility proofs for set agreement and renaming., and . J. Parallel Distributed Comput., (2016)The Time Complexity of Consensus Under Oblivious Message Adversaries., , , , and . ITCS, volume 251 of LIPIcs, page 100:1-100:28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs., , and . ESA, volume 244 of LIPIcs, page 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Sinkless orientation is hard also in the supported LOCAL model., , , , and . CoRR, (2021)Distributed Distance Computation and Related Topics.. Technion - Israel Institute of Technology, Israel, (2017)A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model., and . SODA, page 2153-2161. SIAM, (2017)Input-Dynamic Distributed Algorithms for Communication Networks., , , , and . SIGMETRICS (Abstracts), page 71-72. ACM, (2021)Models of Smoothing in Dynamic Networks., , and . DISC, volume 179 of LIPIcs, page 36:1-36:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)