Published in: LIPIcs, Volume 217, 25th International Conference on Principles of Distributed Systems (OPODIS 2021)
Bernard Mans and Ali Pourmiri. Asynchronous Rumor Spreading in Dynamic Graphs. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 31:1-31:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{mans_et_al:LIPIcs.OPODIS.2021.31, author = {Mans, Bernard and Pourmiri, Ali}, title = {{Asynchronous Rumor Spreading in Dynamic Graphs}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {31:1--31:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-219-8}, ISSN = {1868-8969}, year = {2022}, volume = {217}, editor = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.31}, URN = {urn:nbn:de:0030-drops-158069}, doi = {10.4230/LIPIcs.OPODIS.2021.31}, annote = {Keywords: randomized rumor spreading, push/pull, asynchronous rumor spreading} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Catherine Greenhill, Bernard Mans, and Ali Pourmiri. Balanced Allocation on Dynamic Hypergraphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 11:1-11:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{greenhill_et_al:LIPIcs.APPROX/RANDOM.2020.11, author = {Greenhill, Catherine and Mans, Bernard and Pourmiri, Ali}, title = {{Balanced Allocation on Dynamic Hypergraphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {11:1--11:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.11}, URN = {urn:nbn:de:0030-drops-126149}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.11}, annote = {Keywords: balls-into-bins, balanced allocation, power of two choices, witness tree technique} }
Feedback for Dagstuhl Publishing