<h2>LIPIcs, Volume 253, OPODIS 2022</h2>
<ul>
<li>
<span class="authors">Eshcar Hillel, Roberto Palmieri, and Etienne Rivière</span>
<span class="title">LIPIcs, Volume 253, OPODIS 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022">10.4230/LIPIcs.OPODIS.2022</a>
</li>
<li>
<span class="authors">Eshcar Hillel, Roberto Palmieri, and Etienne Rivière</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.0">10.4230/LIPIcs.OPODIS.2022.0</a>
</li>
<li>
<span class="authors">Victor Luchangco</span>
<span class="title">Theory Meets Practice in the Algorand Blockchain (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.1">10.4230/LIPIcs.OPODIS.2022.1</a>
</li>
<li>
<span class="authors">Panagiota Fatourou</span>
<span class="title">Recoverable Computing (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.2">10.4230/LIPIcs.OPODIS.2022.2</a>
</li>
<li>
<span class="authors">Sébastien Tixeuil</span>
<span class="title">Realistic Self-Stabilization (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.3">10.4230/LIPIcs.OPODIS.2022.3</a>
</li>
<li>
<span class="authors">Colette Johnen, Adnane Khattabi, and Alessia Milani</span>
<span class="title">Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.4">10.4230/LIPIcs.OPODIS.2022.4</a>
</li>
<li>
<span class="authors">Gali Sheffi, Pedro Ramalhete, and Erez Petrank</span>
<span class="title">EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.5">10.4230/LIPIcs.OPODIS.2022.5</a>
</li>
<li>
<span class="authors">Hagit Attiya and Faith Ellen</span>
<span class="title">The Step Complexity of Multidimensional Approximate Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.6">10.4230/LIPIcs.OPODIS.2022.6</a>
</li>
<li>
<span class="authors">Rosina F. Kharal and Trevor Brown</span>
<span class="title">Performance Anomalies in Concurrent Data Structure Microbenchmarks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.7">10.4230/LIPIcs.OPODIS.2022.7</a>
</li>
<li>
<span class="authors">Enrique Fynn, Ethan Buchman, Zarko Milosevic, Robert Soulé, and Fernando Pedone</span>
<span class="title">Robust and Fast Blockchain State Synchronization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.8">10.4230/LIPIcs.OPODIS.2022.8</a>
</li>
<li>
<span class="authors">Rodrigo Q. Saramago, Hein Meling, and Leander N. Jehl</span>
<span class="title">A Privacy-Preserving and Transparent Certification System for Digital Credentials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.9">10.4230/LIPIcs.OPODIS.2022.9</a>
</li>
<li>
<span class="authors">Ignacio Amores-Sesar, Christian Cachin, and Enrico Tedeschi</span>
<span class="title">When Is Spring Coming? A Security Analysis of Avalanche Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.10">10.4230/LIPIcs.OPODIS.2022.10</a>
</li>
<li>
<span class="authors">Taichi Inoue, Naoki Kitamura, Taisuke Izumi, and Toshimitsu Masuzawa</span>
<span class="title">Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.11">10.4230/LIPIcs.OPODIS.2022.11</a>
</li>
<li>
<span class="authors">Jared Coleman, Evangelos Kranakis, Danny Krizanc, and Oscar Morales-Ponce</span>
<span class="title">Line Search for an Oblivious Moving Target</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.12">10.4230/LIPIcs.OPODIS.2022.12</a>
</li>
<li>
<span class="authors">John Augustine, Arnhav Datar, and Nischith Shadagopan</span>
<span class="title">Randomized Byzantine Gathering in Rings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.13">10.4230/LIPIcs.OPODIS.2022.13</a>
</li>
<li>
<span class="authors">Yonghwan Kim, Masahiro Shibata, Yuichi Sudo, Junya Nakamura, Yoshiaki Katayama, and Toshimitsu Masuzawa</span>
<span class="title">Gathering of Mobile Robots with Defected Views</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.14">10.4230/LIPIcs.OPODIS.2022.14</a>
</li>
<li>
<span class="authors">Jannik Castenow, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide</span>
<span class="title">A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.15">10.4230/LIPIcs.OPODIS.2022.15</a>
</li>
<li>
<span class="authors">Ittai Abraham and Gilad Stern</span>
<span class="title">New Dolev-Reischuk Lower Bounds Meet Blockchain Eclipse Attacks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.16">10.4230/LIPIcs.OPODIS.2022.16</a>
</li>
<li>
<span class="authors">Christian Cachin, Giuliano Losa, and Luca Zanolini</span>
<span class="title">Quorum Systems in Permissionless Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.17">10.4230/LIPIcs.OPODIS.2022.17</a>
</li>
<li>
<span class="authors">Shir Cohen, Idit Keidar, and Alexander Spiegelman</span>
<span class="title">Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.18">10.4230/LIPIcs.OPODIS.2022.18</a>
</li>
<li>
<span class="authors">Sarah Azouvi, Christian Cachin, Duc V. Le, Marko Vukolić, and Luca Zanolini</span>
<span class="title">Modeling Resources in Permissionless Longest-Chain Total-Order Broadcast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.19">10.4230/LIPIcs.OPODIS.2022.19</a>
</li>
<li>
<span class="authors">Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, and Ioan Todinca</span>
<span class="title">Computing Power of Hybrid Models in Synchronous Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.20">10.4230/LIPIcs.OPODIS.2022.20</a>
</li>
<li>
<span class="authors">Darya Melnyk, Jukka Suomela, and Neven Villani</span>
<span class="title">Mending Partial Solutions with Few Changes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.21">10.4230/LIPIcs.OPODIS.2022.21</a>
</li>
<li>
<span class="authors">Shihao Liu</span>
<span class="title">The Impossibility of Approximate Agreement on a Larger Class of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.22">10.4230/LIPIcs.OPODIS.2022.22</a>
</li>
<li>
<span class="authors">Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, and Malin Rau</span>
<span class="title">On the Hierarchy of Distributed Majority Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.23">10.4230/LIPIcs.OPODIS.2022.23</a>
</li>
<li>
<span class="authors">Sravya Yandamuri, Ittai Abraham, Kartik Nayak, and Michael K. Reiter</span>
<span class="title">Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.24">10.4230/LIPIcs.OPODIS.2022.24</a>
</li>
<li>
<span class="authors">Neta Rozen-Schiff, Klaus-Tycho Foerster, Stefan Schmid, and David Hay</span>
<span class="title">Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.25">10.4230/LIPIcs.OPODIS.2022.25</a>
</li>
<li>
<span class="authors">Timothé Albouy, Davide Frey, Michel Raynal, and François Taïani</span>
<span class="title">A Modular Approach to Construct Signature-Free BRB Algorithms Under a Message Adversary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.26">10.4230/LIPIcs.OPODIS.2022.26</a>
</li>
<li>
<span class="authors">Yuval Emek, Yuval Gil, and Noga Harlev</span>
<span class="title">Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.27">10.4230/LIPIcs.OPODIS.2022.27</a>
</li>
<li>
<span class="authors">Bernadette Charron-Bost and Louis Penet de Monterno</span>
<span class="title">Self-Stabilizing Clock Synchronization in Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.28">10.4230/LIPIcs.OPODIS.2022.28</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