Author of the publication

Multiple Random Walks on Graphs: Mixing Few to Cover Many.

, , and . ICALP, volume 198 of LIPIcs, page 107:1-107:16. 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

Balanced Allocations in Batches: Simplified and Generalized., and . SPAA, page 389-399. ACM, (2022)The Power of Filling in Balanced Allocations., , and . SIAM J. Discret. Math., 38 (1): 529-565 (March 2024)The Dispersion Time of Random Walks on Finite Graphs., , , and . SPAA, page 103-113. ACM, (2019)Balanced Allocations with Heterogeneous Bins: The Power of Memory., , and . SODA, page 4448-4477. SIAM, (2023)Rumors with Changing Credibility., , , and . ITCS, volume 287 of LIPIcs, page 86:1-86:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Accelerated Information Dissemination on Networks with Local and Global Edges., , , , and . SIROCCO, volume 13298 of Lecture Notes in Computer Science, page 79-97. Springer, (2022)Balanced Allocation in Batches: The Tower of Two Choices., and . CoRR, (2023)Rumors with Changing Credibility., , , and . CoRR, (2023)Balanced Allocations: Caching and Packing, Twinning and Thinning., , and . SODA, page 1847-1874. SIAM, (2022)Multiple Random Walks on Graphs: Mixing Few to Cover Many., , and . ICALP, volume 198 of LIPIcs, page 107:1-107:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)