Author of the publication

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)

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

Are Lock-Free Concurrent Algorithms Practically Wait-Free?, , and . J. ACM, 63 (4): 31:1-31:20 (2016)On Distributed Listing of Cliques., , and . PODC, page 474-482. ACM, (2020)Distributed computations in fully-defective networks., , , and . Distributed Comput., 36 (4): 501-528 (December 2023)Distributed Vertex Cover Reconfiguration., , , and . ITCS, volume 215 of LIPIcs, page 36:1-36:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Locally Checkable Labelings with Small Messages., , , , and . DISC, volume 209 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Near-Optimal Scheduling in the Congested Clique., , and . SIROCCO, volume 12810 of Lecture Notes in Computer Science, page 50-67. Springer, (2021)Finding Subgraphs in Highly Dynamic Networks., , and . SPAA, page 140-150. ACM, (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)Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model., , and . OPODIS, volume 125 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Distributed Computation of the Minimum Triangle Edge Transversal., and . SIROCCO, volume 14662 of Lecture Notes in Computer Science, page 336-358. Springer, (2024)