<h2>LIPIcs, Volume 184, OPODIS 2020</h2>
<ul>
<li>
<span class="authors">Quentin Bramas, Rotem Oshman, and Paolo Romano</span>
<span class="title">LIPIcs, Volume 184, OPODIS 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020">10.4230/LIPIcs.OPODIS.2020</a>
</li>
<li>
<span class="authors">Quentin Bramas, Rotem Oshman, and Paolo Romano</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.0">10.4230/LIPIcs.OPODIS.2020.0</a>
</li>
<li>
<span class="authors">Pascal Felber</span>
<span class="title">Big Data Processing: Security and Scalability Challenges (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.1">10.4230/LIPIcs.OPODIS.2020.1</a>
</li>
<li>
<span class="authors">Idit Keidar</span>
<span class="title">Byzantine Agreement and SMR with Sub-Quadratic Message Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.2">10.4230/LIPIcs.OPODIS.2020.2</a>
</li>
<li>
<span class="authors">Jukka Suomela</span>
<span class="title">Can We Automate Our Own Work - or Show That It Is Hard? (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.3">10.4230/LIPIcs.OPODIS.2020.3</a>
</li>
<li>
<span class="authors">Xiong Zheng and Vijay Garg</span>
<span class="title">Byzantine Lattice Agreement in Asynchronous Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.4">10.4230/LIPIcs.OPODIS.2020.4</a>
</li>
<li>
<span class="authors">Isaac Sheff, Xinwen Wang, Robbert van Renesse, and Andrew C. Myers</span>
<span class="title">Heterogeneous Paxos</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.5">10.4230/LIPIcs.OPODIS.2020.5</a>
</li>
<li>
<span class="authors">Martin Hirt, Ard Kastrati, and Chen-Da Liu-Zhang</span>
<span class="title">Multi-Threshold Asynchronous Reliable Broadcast and Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.6">10.4230/LIPIcs.OPODIS.2020.6</a>
</li>
<li>
<span class="authors">Qinzi Zhang and Lewis Tseng</span>
<span class="title">Echo-CGC: A Communication-Efficient Byzantine-Tolerant Distributed Machine Learning Algorithm in Single-Hop Radio Network</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.7">10.4230/LIPIcs.OPODIS.2020.7</a>
</li>
<li>
<span class="authors">Amine Boussetta, El-Mahdi El-Mhamdi, Rachid Guerraoui, Alexandre Maurer, and Sébastien Rouault</span>
<span class="title">AKSEL: Fast Byzantine SGD</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.8">10.4230/LIPIcs.OPODIS.2020.8</a>
</li>
<li>
<span class="authors">Alexander Spiegelman, Arik Rinberg, and Dahlia Malkhi</span>
<span class="title">ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.9">10.4230/LIPIcs.OPODIS.2020.9</a>
</li>
<li>
<span class="authors">Ignacio Amores-Sesar, Christian Cachin, and Jovana Mićić</span>
<span class="title">Security Analysis of Ripple Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.10">10.4230/LIPIcs.OPODIS.2020.10</a>
</li>
<li>
<span class="authors">Ittai Abraham and Gilad Stern</span>
<span class="title">Information Theoretic HotStuff</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.11">10.4230/LIPIcs.OPODIS.2020.11</a>
</li>
<li>
<span class="authors">Yackolley Amoussou-Guenou, Bruno Biais, Maria Potop-Butucaru, and Sara Tucci-Piergiovanni</span>
<span class="title">Rational Behaviors in Committee-Based Blockchains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.12">10.4230/LIPIcs.OPODIS.2020.12</a>
</li>
<li>
<span class="authors">Armando Castañeda, Sergio Rajsbaum, and Michel Raynal</span>
<span class="title">Relaxed Queues and Stacks from Read/Write Operations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.13">10.4230/LIPIcs.OPODIS.2020.13</a>
</li>
<li>
<span class="authors">Dempsey Wade and Edward Talmage</span>
<span class="title">Fast and Space-Efficient Queues via Relaxation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.14">10.4230/LIPIcs.OPODIS.2020.14</a>
</li>
<li>
<span class="authors">Daniel Katzan and Adam Morrison</span>
<span class="title">Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.15">10.4230/LIPIcs.OPODIS.2020.15</a>
</li>
<li>
<span class="authors">Hagit Attiya, Sweta Kumari, and Noa Schiller</span>
<span class="title">Optimal Resilience in Systems That Mix Shared Memory and Message Passing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.16">10.4230/LIPIcs.OPODIS.2020.16</a>
</li>
<li>
<span class="authors">Soukaina Firmli, Vasileios Trigonakis, Jean-Pierre Lozi, Iraklis Psaroudakis, Alexander Weld, Dalila Chiadmi, Sungpack Hong, and Hassan Chafi</span>
<span class="title">CSR++: A Fast, Scalable, Update-Friendly Graph Data Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.17">10.4230/LIPIcs.OPODIS.2020.17</a>
</li>
<li>
<span class="authors">Hagit Attiya, Armando Castañeda, and Sergio Rajsbaum</span>
<span class="title">Locally Solvable Tasks and the Limitations of Valency Arguments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.18">10.4230/LIPIcs.OPODIS.2020.18</a>
</li>
<li>
<span class="authors">Talley Amir, James Aspnes, and John Lazarsfeld</span>
<span class="title">Approximate Majority with Catalytic Inputs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.19">10.4230/LIPIcs.OPODIS.2020.19</a>
</li>
<li>
<span class="authors">Ritam Ganguly, Anik Momtaz, and Borzoo Bonakdarpour</span>
<span class="title">Distributed Runtime Verification Under Partial Synchrony</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.20">10.4230/LIPIcs.OPODIS.2020.20</a>
</li>
<li>
<span class="authors">Mahboubeh Samadi, Fatemeh Ghassemi, and Ramtin Khosravi</span>
<span class="title">Decentralized Runtime Enforcement of Message Sequences in Message-Based Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.21">10.4230/LIPIcs.OPODIS.2020.21</a>
</li>
<li>
<span class="authors">Haimin Chen and Chaodong Zheng</span>
<span class="title">Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.22">10.4230/LIPIcs.OPODIS.2020.22</a>
</li>
<li>
<span class="authors">Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, and Andrei Tonkikh</span>
<span class="title">Dynamic Byzantine Reliable Broadcast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.23">10.4230/LIPIcs.OPODIS.2020.23</a>
</li>
<li>
<span class="authors">Shantanu Das, Nikos Giachoudis, Flaminia L. Luccio, and Euripides Markou</span>
<span class="title">Broadcasting with Mobile Agents in Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.24">10.4230/LIPIcs.OPODIS.2020.24</a>
</li>
<li>
<span class="authors">Chen-Da Liu-Zhang, Varun Maram, and Ueli Maurer</span>
<span class="title">On Broadcast in Generalized Network and Adversarial Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.25">10.4230/LIPIcs.OPODIS.2020.25</a>
</li>
<li>
<span class="authors">Mahmoud Parham, Klaus-Tycho Foerster, Petar Kosic, and Stefan Schmid</span>
<span class="title">Maximally Resilient Replacement Paths for a Family of Product Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.26">10.4230/LIPIcs.OPODIS.2020.26</a>
</li>
<li>
<span class="authors">Alexandre Maurer</span>
<span class="title">Self-Stabilizing Byzantine-Resilient Communication in Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.27">10.4230/LIPIcs.OPODIS.2020.27</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, and Gregory Schwartzman</span>
<span class="title">Fast Deterministic Algorithms for Highly-Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.28">10.4230/LIPIcs.OPODIS.2020.28</a>
</li>
<li>
<span class="authors">Salwa Faour and Fabian Kuhn</span>
<span class="title">Approximating Bipartite Minimum Vertex Cover in the CONGEST Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.29">10.4230/LIPIcs.OPODIS.2020.29</a>
</li>
<li>
<span class="authors">Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, and Virginia Vassilevska Williams</span>
<span class="title">Distributed Distance Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.30">10.4230/LIPIcs.OPODIS.2020.30</a>
</li>
<li>
<span class="authors">Michael Feldmann, Kristian Hinnenthal, and Christian Scheideler</span>
<span class="title">Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.31">10.4230/LIPIcs.OPODIS.2020.31</a>
</li>
<li>
<span class="authors">Leonid Barenboim and Harel Levin</span>
<span class="title">Secured Distributed Algorithms Without Hardness Assumptions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.32">10.4230/LIPIcs.OPODIS.2020.32</a>
</li>
<li>
<span class="authors">Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, and Sébastien Tixeuil</span>
<span class="title">Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.33">10.4230/LIPIcs.OPODIS.2020.33</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