Author of the publication

Asynchronous Rumor Spreading in Dynamic Graphs.

, and . OPODIS, volume 217 of LIPIcs, page 31:1-31:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

The Team Order Problem: Maximizing the Probability of Matching Being Large Enough., , , and . SAGT, volume 15156 of Lecture Notes in Computer Science, page 35-52. Springer, (2024)Balanced Allocation on Dynamic Hypergraphs., , and . APPROX-RANDOM, volume 176 of LIPIcs, page 11:1-11:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Task Allocation using a Team of Robots., , , , and . CoRR, (2022)Predicting user demographics based on interest analysis in movie dataset., , and . Multim. Tools Appl., 83 (27): 69973-69987 (August 2024)Ultra-Fast Asynchronous Randomized Rumor Spreading (Brief Announcement)., and . SPAA, page 81-83. ACM, (2019)Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks., and . PODC, page 263-272. ACM, (2020)Asynchronous Rumor Spreading in Dynamic Graphs., and . OPODIS, volume 217 of LIPIcs, page 31:1-31:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)