<h2>LIPIcs, Volume 217, OPODIS 2021</h2>
<ul>
<li>
<span class="authors">Quentin Bramas, Vincent Gramoli, and Alessia Milani</span>
<span class="title">LIPIcs, Volume 217, OPODIS 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021">10.4230/LIPIcs.OPODIS.2021</a>
</li>
<li>
<span class="authors">Quentin Bramas, Vincent Gramoli, and Alessia Milani</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.0">10.4230/LIPIcs.OPODIS.2021.0</a>
</li>
<li>
<span class="authors">Nathalie Bertrand</span>
<span class="title">Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.1">10.4230/LIPIcs.OPODIS.2021.1</a>
</li>
<li>
<span class="authors">Petr Kuznetsov</span>
<span class="title">Accountable Distributed Computing (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.2">10.4230/LIPIcs.OPODIS.2021.2</a>
</li>
<li>
<span class="authors">Robbert van Renesse</span>
<span class="title">A Fresh Look at the Design and Implementation of Communication Paradigms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.3">10.4230/LIPIcs.OPODIS.2021.3</a>
</li>
<li>
<span class="authors">Alexandre Maurer</span>
<span class="title">Arbitrarily Accurate Aggregation Scheme for Byzantine SGD</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.4">10.4230/LIPIcs.OPODIS.2021.4</a>
</li>
<li>
<span class="authors">Ittai Abraham, Ling Ren, and Zhuolun Xiang</span>
<span class="title">Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.5">10.4230/LIPIcs.OPODIS.2021.5</a>
</li>
<li>
<span class="authors">Emmanuelle Anceaume, Antonella Del Pozzo, Thibault Rieutord, and Sara Tucci-Piergiovanni</span>
<span class="title">On Finality in Blockchains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.6">10.4230/LIPIcs.OPODIS.2021.6</a>
</li>
<li>
<span class="authors">Shehar Bano, Alberto Sonnino, Andrey Chursin, Dmitri Perelman, Zekun Li, Avery Ching, and Dahlia Malkhi</span>
<span class="title">Twins: BFT Systems Made Robust</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.7">10.4230/LIPIcs.OPODIS.2021.7</a>
</li>
<li>
<span class="authors">Ajay D. Kshemkalyani and Gokarna Sharma</span>
<span class="title">Near-Optimal Dispersion on Arbitrary Anonymous Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.8">10.4230/LIPIcs.OPODIS.2021.8</a>
</li>
<li>
<span class="authors">Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, and Koichi Wada</span>
<span class="title">Asynchronous Gathering in a Torus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.9">10.4230/LIPIcs.OPODIS.2021.9</a>
</li>
<li>
<span class="authors">Kaustav Bose, Archak Das, and Buddhadeb Sau</span>
<span class="title">Pattern Formation by Robots with Inaccurate Movements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.10">10.4230/LIPIcs.OPODIS.2021.10</a>
</li>
<li>
<span class="authors">Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs</span>
<span class="title">Near-Shortest Path Routing in Hybrid Communication Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.11">10.4230/LIPIcs.OPODIS.2021.11</a>
</li>
<li>
<span class="authors">Leszek Gąsieniec, Jesper Jansson, Christos Levcopoulos, and Andrzej Lingas</span>
<span class="title">Efficient Assignment of Identities in Anonymous Populations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.12">10.4230/LIPIcs.OPODIS.2021.12</a>
</li>
<li>
<span class="authors">Hiroto Yasumi, Fukuhito Ooshita, and Michiko Inoue</span>
<span class="title">Population Protocols for Graph Class Identification Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.13">10.4230/LIPIcs.OPODIS.2021.13</a>
</li>
<li>
<span class="authors">Dan Alistarh, Rati Gelashvili, and Joel Rybicki</span>
<span class="title">Fast Graphical Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.14">10.4230/LIPIcs.OPODIS.2021.14</a>
</li>
<li>
<span class="authors">Amir Nikabadi and Janne H. Korhonen</span>
<span class="title">Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.15">10.4230/LIPIcs.OPODIS.2021.15</a>
</li>
<li>
<span class="authors">Sebastian Forster, Martin Grösbacher, and Tijn de Vos</span>
<span class="title">An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.16">10.4230/LIPIcs.OPODIS.2021.16</a>
</li>
<li>
<span class="authors">Salwa Faour, Marc Fuchs, and Fabian Kuhn</span>
<span class="title">Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.17">10.4230/LIPIcs.OPODIS.2021.17</a>
</li>
<li>
<span class="authors">Alkida Balliu, Fabian Kuhn, and Dennis Olivetti</span>
<span class="title">Improved Distributed Fractional Coloring Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.18">10.4230/LIPIcs.OPODIS.2021.18</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, and Mikaël Rabie</span>
<span class="title">Distributed Recoloring of Interval and Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.19">10.4230/LIPIcs.OPODIS.2021.19</a>
</li>
<li>
<span class="authors">Bapi Chatterjee, Sathya Peri, Muktikanta Sa, and Komma Manogna</span>
<span class="title">Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.20">10.4230/LIPIcs.OPODIS.2021.20</a>
</li>
<li>
<span class="authors">Orr Fischer, Rotem Oshman, and Dana Shamir</span>
<span class="title">Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.21">10.4230/LIPIcs.OPODIS.2021.21</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Laurent Feuilloley, and Théo Pierron</span>
<span class="title">Local Certification of Graph Decompositions and Applications to Minor-Free Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.22">10.4230/LIPIcs.OPODIS.2021.22</a>
</li>
<li>
<span class="authors">Luciano Freitas de Souza, Andrei Tonkikh, Sara Tucci-Piergiovanni, Renaud Sirdey, Oana Stan, Nicolas Quero, and Petr Kuznetsov</span>
<span class="title">RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.23">10.4230/LIPIcs.OPODIS.2021.23</a>
</li>
<li>
<span class="authors">Lélia Blin, Laurent Feuilloley, and Gabriel Le Bouder</span>
<span class="title">Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.24">10.4230/LIPIcs.OPODIS.2021.24</a>
</li>
<li>
<span class="authors">Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, and Sara Tucci-Piergiovanni</span>
<span class="title">Accountability and Reconfiguration: Self-Healing Lattice Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.25">10.4230/LIPIcs.OPODIS.2021.25</a>
</li>
<li>
<span class="authors">William Schultz, Siyuan Zhou, Ian Dardik, and Stavros Tripakis</span>
<span class="title">Design and Analysis of a Logless Dynamic Reconfiguration Protocol</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.26">10.4230/LIPIcs.OPODIS.2021.26</a>
</li>
<li>
<span class="authors">Ittai Abraham, Kartik Nayak, and Nibesh Shrestha</span>
<span class="title">Optimal Good-Case Latency for Rotating Leader Synchronous BFT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.27">10.4230/LIPIcs.OPODIS.2021.27</a>
</li>
<li>
<span class="authors">Steven Munsu Hwang and Philipp Woelfel</span>
<span class="title">Strongly Linearizable Linked List and Queue</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.28">10.4230/LIPIcs.OPODIS.2021.28</a>
</li>
<li>
<span class="authors">Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, and Danny Hendler</span>
<span class="title">Recoverable and Detectable Fetch&Add</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.29">10.4230/LIPIcs.OPODIS.2021.29</a>
</li>
<li>
<span class="authors">Gal Assa, Hagar Meir, Guy Golan-Gueta, Idit Keidar, and Alexander Spiegelman</span>
<span class="title">Using Nesting to Push the Limits of Transactional Data Structure Libraries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.30">10.4230/LIPIcs.OPODIS.2021.30</a>
</li>
<li>
<span class="authors">Bernard Mans and Ali Pourmiri</span>
<span class="title">Asynchronous Rumor Spreading in Dynamic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2021.31">10.4230/LIPIcs.OPODIS.2021.31</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing