25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 1-580, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{bramas_et_al:LIPIcs.OPODIS.2021, title = {{LIPIcs, Volume 217, OPODIS 2021, Complete Volume}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {1--580}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021}, URN = {urn:nbn:de:0030-drops-157746}, doi = {10.4230/LIPIcs.OPODIS.2021}, annote = {Keywords: LIPIcs, Volume 217, OPODIS 2021, Complete Volume} }
25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bramas_et_al:LIPIcs.OPODIS.2021.0, author = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {0:i--0:xvi}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.0}, URN = {urn:nbn:de:0030-drops-157752}, doi = {10.4230/LIPIcs.OPODIS.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Nathalie Bertrand. Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk). In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bertrand:LIPIcs.OPODIS.2021.1, author = {Bertrand, Nathalie}, title = {{Distributed Algorithms: A Challenging Playground for Model Checking}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {1:1--1:1}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.1}, URN = {urn:nbn:de:0030-drops-157767}, doi = {10.4230/LIPIcs.OPODIS.2021.1}, annote = {Keywords: Verification, Distributed algorithms} }
Petr Kuznetsov. Accountable Distributed Computing (Invited Talk). In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kuznetsov:LIPIcs.OPODIS.2021.2, author = {Kuznetsov, Petr}, title = {{Accountable Distributed Computing}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {2:1--2:1}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.2}, URN = {urn:nbn:de:0030-drops-157775}, doi = {10.4230/LIPIcs.OPODIS.2021.2}, annote = {Keywords: Fault-tolerance, fault detection, accountability, application-specific} }
Robbert van Renesse. A Fresh Look at the Design and Implementation of Communication Paradigms (Invited Talk). In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{vanrenesse:LIPIcs.OPODIS.2021.3, author = {van Renesse, Robbert}, title = {{A Fresh Look at the Design and Implementation of Communication Paradigms}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {3:1--3:1}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.3}, URN = {urn:nbn:de:0030-drops-157780}, doi = {10.4230/LIPIcs.OPODIS.2021.3}, annote = {Keywords: Distributed systems} }
Alexandre Maurer. Arbitrarily Accurate Aggregation Scheme for Byzantine SGD. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{maurer:LIPIcs.OPODIS.2021.4, author = {Maurer, Alexandre}, title = {{Arbitrarily Accurate Aggregation Scheme for Byzantine SGD}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {4:1--4:17}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.4}, URN = {urn:nbn:de:0030-drops-157793}, doi = {10.4230/LIPIcs.OPODIS.2021.4}, annote = {Keywords: distributed machine learning, Byzantine failures, stochastic gradient descent} }
Ittai Abraham, Ling Ren, and Zhuolun Xiang. Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{abraham_et_al:LIPIcs.OPODIS.2021.5, author = {Abraham, Ittai and Ren, Ling and Xiang, Zhuolun}, title = {{Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {5:1--5: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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.5}, URN = {urn:nbn:de:0030-drops-157806}, doi = {10.4230/LIPIcs.OPODIS.2021.5}, annote = {Keywords: Byzantine broadcast, asynchrony, synchrony, latency, good-case, optimal} }
Emmanuelle Anceaume, Antonella Del Pozzo, Thibault Rieutord, and Sara Tucci-Piergiovanni. On Finality in Blockchains. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 6:1-6:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{anceaume_et_al:LIPIcs.OPODIS.2021.6, author = {Anceaume, Emmanuelle and Del Pozzo, Antonella and Rieutord, Thibault and Tucci-Piergiovanni, Sara}, title = {{On Finality in Blockchains}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {6:1--6:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.6}, URN = {urn:nbn:de:0030-drops-157810}, doi = {10.4230/LIPIcs.OPODIS.2021.6}, annote = {Keywords: Blockchain, consistency properties, Byzantine tolerant implementations} }
Shehar Bano, Alberto Sonnino, Andrey Chursin, Dmitri Perelman, Zekun Li, Avery Ching, and Dahlia Malkhi. Twins: BFT Systems Made Robust. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 7:1-7:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bano_et_al:LIPIcs.OPODIS.2021.7, author = {Bano, Shehar and Sonnino, Alberto and Chursin, Andrey and Perelman, Dmitri and Li, Zekun and Ching, Avery and Malkhi, Dahlia}, title = {{Twins: BFT Systems Made Robust}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {7:1--7:29}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.7}, URN = {urn:nbn:de:0030-drops-157825}, doi = {10.4230/LIPIcs.OPODIS.2021.7}, annote = {Keywords: Distributed Systems, Byzantine Fault Tolerance, Real-World Deployment} }
Ajay D. Kshemkalyani and Gokarna Sharma. Near-Optimal Dispersion on Arbitrary Anonymous Graphs. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 8:1-8:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kshemkalyani_et_al:LIPIcs.OPODIS.2021.8, author = {Kshemkalyani, Ajay D. and Sharma, Gokarna}, title = {{Near-Optimal Dispersion on Arbitrary Anonymous Graphs}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {8:1--8:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.8}, URN = {urn:nbn:de:0030-drops-157837}, doi = {10.4230/LIPIcs.OPODIS.2021.8}, annote = {Keywords: Distributed algorithms, Multi-agent systems, Mobile robots, Local communication, Dispersion, Exploration, Time and memory complexity} }
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, and Koichi Wada. Asynchronous Gathering in a Torus. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kamei_et_al:LIPIcs.OPODIS.2021.9, author = {Kamei, Sayaka and Lamani, Anissa and Ooshita, Fukuhito and Tixeuil, S\'{e}bastien and Wada, Koichi}, title = {{Asynchronous Gathering in a Torus}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {9:1--9:17}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.9}, URN = {urn:nbn:de:0030-drops-157845}, doi = {10.4230/LIPIcs.OPODIS.2021.9}, annote = {Keywords: Autonomous distributed systems, Robots gathering, Torus} }
Kaustav Bose, Archak Das, and Buddhadeb Sau. Pattern Formation by Robots with Inaccurate Movements. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 10:1-10:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bose_et_al:LIPIcs.OPODIS.2021.10, author = {Bose, Kaustav and Das, Archak and Sau, Buddhadeb}, title = {{Pattern Formation by Robots with Inaccurate Movements}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {10:1--10: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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.10}, URN = {urn:nbn:de:0030-drops-157850}, doi = {10.4230/LIPIcs.OPODIS.2021.10}, annote = {Keywords: Distributed Algorithm, Mobile Robots, Movement Error, Approximate Arbitrary Pattern Formation, Look-Compute-Move, Minimum Enclosing Circle} }
Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. Near-Shortest Path Routing in Hybrid Communication Networks. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 11:1-11:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{coy_et_al:LIPIcs.OPODIS.2021.11, author = {Coy, Sam and Czumaj, Artur and Feldmann, Michael and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp and Struijs, Martijn}, title = {{Near-Shortest Path Routing in Hybrid Communication Networks}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {11:1--11:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.11}, URN = {urn:nbn:de:0030-drops-157863}, doi = {10.4230/LIPIcs.OPODIS.2021.11}, annote = {Keywords: Hybrid networks, overlay networks} }
Leszek Gąsieniec, Jesper Jansson, Christos Levcopoulos, and Andrzej Lingas. Efficient Assignment of Identities in Anonymous Populations. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 12:1-12:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gasieniec_et_al:LIPIcs.OPODIS.2021.12, author = {G\k{a}sieniec, Leszek and Jansson, Jesper and Levcopoulos, Christos and Lingas, Andrzej}, title = {{Efficient Assignment of Identities in Anonymous Populations}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {12:1--12:21}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.12}, URN = {urn:nbn:de:0030-drops-157871}, doi = {10.4230/LIPIcs.OPODIS.2021.12}, annote = {Keywords: population protocol, state efficiency, time efficiency, one-way epidemics, leader election, agent identities} }
Hiroto Yasumi, Fukuhito Ooshita, and Michiko Inoue. Population Protocols for Graph Class Identification Problems. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 13:1-13:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{yasumi_et_al:LIPIcs.OPODIS.2021.13, author = {Yasumi, Hiroto and Ooshita, Fukuhito and Inoue, Michiko}, title = {{Population Protocols for Graph Class Identification Problems}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {13:1--13:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.13}, URN = {urn:nbn:de:0030-drops-157885}, doi = {10.4230/LIPIcs.OPODIS.2021.13}, annote = {Keywords: population protocol, graph class identification, distributed protocol} }
Dan Alistarh, Rati Gelashvili, and Joel Rybicki. Fast Graphical Population Protocols. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{alistarh_et_al:LIPIcs.OPODIS.2021.14, author = {Alistarh, Dan and Gelashvili, Rati and Rybicki, Joel}, title = {{Fast Graphical Population Protocols}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {14:1--14:18}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.14}, URN = {urn:nbn:de:0030-drops-157897}, doi = {10.4230/LIPIcs.OPODIS.2021.14}, annote = {Keywords: population protocols, leader election, exact majority, graphs} }
Amir Nikabadi and Janne H. Korhonen. Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 15:1-15:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{nikabadi_et_al:LIPIcs.OPODIS.2021.15, author = {Nikabadi, Amir and Korhonen, Janne H.}, title = {{Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {15:1--15:18}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.15}, URN = {urn:nbn:de:0030-drops-157902}, doi = {10.4230/LIPIcs.OPODIS.2021.15}, annote = {Keywords: distributed algorithms, parameterized distributed complexity, CONGEST model, induced subgraph detection, graph parameters, lower bounds} }
Sebastian Forster, Martin Grösbacher, and Tijn de Vos. An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 16:1-16:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{forster_et_al:LIPIcs.OPODIS.2021.16, author = {Forster, Sebastian and Gr\"{o}sbacher, Martin and de Vos, Tijn}, title = {{An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {16:1--16:17}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.16}, URN = {urn:nbn:de:0030-drops-157914}, doi = {10.4230/LIPIcs.OPODIS.2021.16}, annote = {Keywords: Spanner, low diameter decomposition, synchronizer, distributed graph algorithms} }
Salwa Faour, Marc Fuchs, and Fabian Kuhn. Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 17:1-17:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{faour_et_al:LIPIcs.OPODIS.2021.17, author = {Faour, Salwa and Fuchs, Marc and Kuhn, Fabian}, title = {{Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {17:1--17: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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.17}, URN = {urn:nbn:de:0030-drops-157928}, doi = {10.4230/LIPIcs.OPODIS.2021.17}, annote = {Keywords: distributed graph algorithms, minimum weighted vertex cover, maximum weighted matching, distributed optimization, CONGEST model} }
Alkida Balliu, Fabian Kuhn, and Dennis Olivetti. Improved Distributed Fractional Coloring Algorithms. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 18:1-18:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{balliu_et_al:LIPIcs.OPODIS.2021.18, author = {Balliu, Alkida and Kuhn, Fabian and Olivetti, Dennis}, title = {{Improved Distributed Fractional Coloring Algorithms}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {18:1--18:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.18}, URN = {urn:nbn:de:0030-drops-157935}, doi = {10.4230/LIPIcs.OPODIS.2021.18}, annote = {Keywords: distributed graph algorithms, distributed coloring, locality, fractional coloring} }
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, and Mikaël Rabie. Distributed Recoloring of Interval and Chordal Graphs. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 19:1-19:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bousquet_et_al:LIPIcs.OPODIS.2021.19, author = {Bousquet, Nicolas and Feuilloley, Laurent and Heinrich, Marc and Rabie, Mika\"{e}l}, title = {{Distributed Recoloring of Interval and Chordal Graphs}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {19:1--19:17}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.19}, URN = {urn:nbn:de:0030-drops-157941}, doi = {10.4230/LIPIcs.OPODIS.2021.19}, annote = {Keywords: Distributed coloring, distributed recoloring, interval graphs, chordal graphs, intersection graphs} }
Bapi Chatterjee, Sathya Peri, Muktikanta Sa, and Komma Manogna. Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 20:1-20:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chatterjee_et_al:LIPIcs.OPODIS.2021.20, author = {Chatterjee, Bapi and Peri, Sathya and Sa, Muktikanta and Manogna, Komma}, title = {{Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {20:1--20:25}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.20}, URN = {urn:nbn:de:0030-drops-157952}, doi = {10.4230/LIPIcs.OPODIS.2021.20}, annote = {Keywords: concurrent data structure, linearizability, non-blocking, directed graph, breadth-first search, single-source shortest-path, betweenness centrality} }
Orr Fischer, Rotem Oshman, and Dana Shamir. Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 21:1-21:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fischer_et_al:LIPIcs.OPODIS.2021.21, author = {Fischer, Orr and Oshman, Rotem and Shamir, Dana}, title = {{Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {21:1--21:22}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.21}, URN = {urn:nbn:de:0030-drops-157969}, doi = {10.4230/LIPIcs.OPODIS.2021.21}, annote = {Keywords: proof-labeling schemes, space-time tradeoffs, families with excluded minor} }
Nicolas Bousquet, Laurent Feuilloley, and Théo Pierron. Local Certification of Graph Decompositions and Applications to Minor-Free Classes. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 22:1-22:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bousquet_et_al:LIPIcs.OPODIS.2021.22, author = {Bousquet, Nicolas and Feuilloley, Laurent and Pierron, Th\'{e}o}, title = {{Local Certification of Graph Decompositions and Applications to Minor-Free Classes}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {22:1--22:17}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.22}, URN = {urn:nbn:de:0030-drops-157970}, doi = {10.4230/LIPIcs.OPODIS.2021.22}, annote = {Keywords: Local certification, proof-labeling schemes, locally checkable proofs, graph decompositions, minor-free graphs} }
Luciano Freitas de Souza, Andrei Tonkikh, Sara Tucci-Piergiovanni, Renaud Sirdey, Oana Stan, Nicolas Quero, and Petr Kuznetsov. RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{freitasdesouza_et_al:LIPIcs.OPODIS.2021.23, author = {Freitas de Souza, Luciano and Tonkikh, Andrei and Tucci-Piergiovanni, Sara and Sirdey, Renaud and Stan, Oana and Quero, Nicolas and Kuznetsov, Petr}, title = {{RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {23:1--23:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.23}, URN = {urn:nbn:de:0030-drops-157986}, doi = {10.4230/LIPIcs.OPODIS.2021.23}, annote = {Keywords: Byzantine Fault Tolerance, Partially Synchronous, Deterministic Termination, Randomness Beacon, Multi Party Computation, BFT-RNG} }
Lélia Blin, Laurent Feuilloley, and Gabriel Le Bouder. Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 24:1-24:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{blin_et_al:LIPIcs.OPODIS.2021.24, author = {Blin, L\'{e}lia and Feuilloley, Laurent and Le Bouder, Gabriel}, title = {{Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {24:1--24:12}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.24}, URN = {urn:nbn:de:0030-drops-157997}, doi = {10.4230/LIPIcs.OPODIS.2021.24}, annote = {Keywords: Space lower bound, memory tight bound, self-stabilization, leader election, anonymous, identifiers, state model, ring topology} }
Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, and Sara Tucci-Piergiovanni. Accountability and Reconfiguration: Self-Healing Lattice Agreement. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 25:1-25:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{freitasdesouza_et_al:LIPIcs.OPODIS.2021.25, author = {Freitas de Souza, Luciano and Kuznetsov, Petr and Rieutord, Thibault and Tucci-Piergiovanni, Sara}, title = {{Accountability and Reconfiguration: Self-Healing Lattice Agreement}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {25:1--25:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.25}, URN = {urn:nbn:de:0030-drops-158007}, doi = {10.4230/LIPIcs.OPODIS.2021.25}, annote = {Keywords: Reconfiguration, accountability, asynchronous, lattice agreement} }
William Schultz, Siyuan Zhou, Ian Dardik, and Stavros Tripakis. Design and Analysis of a Logless Dynamic Reconfiguration Protocol. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{schultz_et_al:LIPIcs.OPODIS.2021.26, author = {Schultz, William and Zhou, Siyuan and Dardik, Ian and Tripakis, Stavros}, title = {{Design and Analysis of a Logless Dynamic Reconfiguration Protocol}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {26:1--26:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.26}, URN = {urn:nbn:de:0030-drops-158016}, doi = {10.4230/LIPIcs.OPODIS.2021.26}, annote = {Keywords: Fault Tolerance, Dynamic Reconfiguration, State Machine Replication} }
Ittai Abraham, Kartik Nayak, and Nibesh Shrestha. Optimal Good-Case Latency for Rotating Leader Synchronous BFT. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 27:1-27:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{abraham_et_al:LIPIcs.OPODIS.2021.27, author = {Abraham, Ittai and Nayak, Kartik and Shrestha, Nibesh}, title = {{Optimal Good-Case Latency for Rotating Leader Synchronous BFT}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {27:1--27:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.27}, URN = {urn:nbn:de:0030-drops-158022}, doi = {10.4230/LIPIcs.OPODIS.2021.27}, annote = {Keywords: Distributed Computing, Byzantine Fault Tolerance, Synchrony} }
Steven Munsu Hwang and Philipp Woelfel. Strongly Linearizable Linked List and Queue. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 28:1-28:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hwang_et_al:LIPIcs.OPODIS.2021.28, author = {Hwang, Steven Munsu and Woelfel, Philipp}, title = {{Strongly Linearizable Linked List and Queue}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {28:1--28: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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.28}, URN = {urn:nbn:de:0030-drops-158030}, doi = {10.4230/LIPIcs.OPODIS.2021.28}, annote = {Keywords: Strong linearizability, compare-and-swap, linked list, queue, lock-freedom} }
Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, and Danny Hendler. Recoverable and Detectable Fetch&Add. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 29:1-29:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{nahum_et_al:LIPIcs.OPODIS.2021.29, author = {Nahum, Liad and Attiya, Hagit and Ben-Baruch, Ohad and Hendler, Danny}, title = {{Recoverable and Detectable Fetch\&Add}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {29:1--29:17}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.29}, URN = {urn:nbn:de:0030-drops-158043}, doi = {10.4230/LIPIcs.OPODIS.2021.29}, annote = {Keywords: Multi-core algorithms, persistent memory, non-volatile memory} }
Gal Assa, Hagar Meir, Guy Golan-Gueta, Idit Keidar, and Alexander Spiegelman. Using Nesting to Push the Limits of Transactional Data Structure Libraries. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 30:1-30:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{assa_et_al:LIPIcs.OPODIS.2021.30, author = {Assa, Gal and Meir, Hagar and Golan-Gueta, Guy and Keidar, Idit and Spiegelman, Alexander}, title = {{Using Nesting to Push the Limits of Transactional Data Structure Libraries}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {30:1--30:17}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.30}, URN = {urn:nbn:de:0030-drops-158058}, doi = {10.4230/LIPIcs.OPODIS.2021.30}, annote = {Keywords: Transactional Libraries, Nesting} }
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.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} }
Feedback for Dagstuhl Publishing