<h2>LIPIcs, Volume 286, OPODIS 2023</h2>
<ul>
<li>
<span class="authors">Alysson Bessani, Xavier Défago, Junya Nakamura, Koichi Wada, and Yukiko Yamauchi</span>
<span class="title">LIPIcs, Volume 286, OPODIS 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023">10.4230/LIPIcs.OPODIS.2023</a>
</li>
<li>
<span class="authors">Alysson Bessani, Xavier Défago, Junya Nakamura, Koichi Wada, and Yukiko Yamauchi</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.0">10.4230/LIPIcs.OPODIS.2023.0</a>
</li>
<li>
<span class="authors">Vincent Gramoli</span>
<span class="title">From Consensus Research to Redbelly Network Pty Ltd (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.1">10.4230/LIPIcs.OPODIS.2023.1</a>
</li>
<li>
<span class="authors">François Le Gall</span>
<span class="title">Quantum Distributed Computing: Potential and Limitations (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.2">10.4230/LIPIcs.OPODIS.2023.2</a>
</li>
<li>
<span class="authors">Roger Wattenhofer</span>
<span class="title">Distributed Algorithms as a Gateway To Deductive Learning (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.3">10.4230/LIPIcs.OPODIS.2023.3</a>
</li>
<li>
<span class="authors">Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, and Alexandre Rapetti</span>
<span class="title">The Synchronization Power of Auditable Registers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.4">10.4230/LIPIcs.OPODIS.2023.4</a>
</li>
<li>
<span class="authors">Caterina Feletti, Carlo Mereghetti, and Beatrice Palano</span>
<span class="title">𝒪(log{n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.5">10.4230/LIPIcs.OPODIS.2023.5</a>
</li>
<li>
<span class="authors">Hagit Attiya and Jennifer L. Welch</span>
<span class="title">Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.6">10.4230/LIPIcs.OPODIS.2023.6</a>
</li>
<li>
<span class="authors">Jamison W. Weber, Tishya Chhabra, Andréa W. Richa, and Joshua J. Daymude</span>
<span class="title">Energy-Constrained Programmable Matter Under Unfair Adversaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.7">10.4230/LIPIcs.OPODIS.2023.7</a>
</li>
<li>
<span class="authors">Andrei Constantinescu, Diana Ghinea, Lioba Heimbach, Zilin Wang, and Roger Wattenhofer</span>
<span class="title">A Fair and Resilient Decentralized Clock Network for Transaction Ordering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.8">10.4230/LIPIcs.OPODIS.2023.8</a>
</li>
<li>
<span class="authors">Lewis Tseng and Callie Sardina</span>
<span class="title">Byzantine Consensus in Abstract MAC Layer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.9">10.4230/LIPIcs.OPODIS.2023.9</a>
</li>
<li>
<span class="authors">Colin Cooper, Tomasz Radzik, and Takeharu Shiraga</span>
<span class="title">Discrete Incremental Voting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.10">10.4230/LIPIcs.OPODIS.2023.10</a>
</li>
<li>
<span class="authors">Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid</span>
<span class="title">On the Convergence Time in Graphical Games: A Locality-Sensitive Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.11">10.4230/LIPIcs.OPODIS.2023.11</a>
</li>
<li>
<span class="authors">Orestis Alpos, Ignacio Amores-Sesar, Christian Cachin, and Michelle Yeo</span>
<span class="title">Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.12">10.4230/LIPIcs.OPODIS.2023.12</a>
</li>
<li>
<span class="authors">Charlie Carlson, Daniel Frishberg, and Eric Vigoda</span>
<span class="title">Improved Distributed Algorithms for Random Colorings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.13">10.4230/LIPIcs.OPODIS.2023.13</a>
</li>
<li>
<span class="authors">Andrew Lewis-Pye and Ittai Abraham</span>
<span class="title">Fever: Optimal Responsive View Synchronisation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.14">10.4230/LIPIcs.OPODIS.2023.14</a>
</li>
<li>
<span class="authors">Ramy Fakhoury, Anastasia Braginsky, Idit Keidar, and Yoav Zuriel</span>
<span class="title">Nova: Safe Off-Heap Memory Allocation and Reclamation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.15">10.4230/LIPIcs.OPODIS.2023.15</a>
</li>
<li>
<span class="authors">Yuval Gil</span>
<span class="title">Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.16">10.4230/LIPIcs.OPODIS.2023.16</a>
</li>
<li>
<span class="authors">Shalom M. Asbell and Eric Ruppert</span>
<span class="title">A Wait-Free Deque With Polylogarithmic Step Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.17">10.4230/LIPIcs.OPODIS.2023.17</a>
</li>
<li>
<span class="authors">Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil</span>
<span class="title">Reliable Broadcast Despite Mobile Byzantine Faults</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.18">10.4230/LIPIcs.OPODIS.2023.18</a>
</li>
<li>
<span class="authors">Ariel Livshits and Yoram Moses</span>
<span class="title">Probable Approximate Coordination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.19">10.4230/LIPIcs.OPODIS.2023.19</a>
</li>
<li>
<span class="authors">Junghyun Lee, Laura Schmid, and Se-Young Yun</span>
<span class="title">Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.20">10.4230/LIPIcs.OPODIS.2023.20</a>
</li>
<li>
<span class="authors">Alejandro Naser-Pastoriza, Gregory Chockler, and Alexey Gotsman</span>
<span class="title">Fault-Tolerant Computing with Unreliable Channels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.21">10.4230/LIPIcs.OPODIS.2023.21</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, John Augustine, David Peleg, and Srikkanth Ramachandran</span>
<span class="title">Local Recurrent Problems in the SUPPORTED Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.22">10.4230/LIPIcs.OPODIS.2023.22</a>
</li>
<li>
<span class="authors">Jämes Ménétrey, Aeneas Grüter, Peterson Yuhala, Julius Oeftiger, Pascal Felber, Marcelo Pasin, and Valerio Schiavoni</span>
<span class="title">A Holistic Approach for Trustworthy Distributed Systems with WebAssembly and TEEs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.23">10.4230/LIPIcs.OPODIS.2023.23</a>
</li>
<li>
<span class="authors">Tomer Lev Lehman, Hagit Attiya, and Danny Hendler</span>
<span class="title">Recoverable and Detectable Self-Implementations of Swap</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.24">10.4230/LIPIcs.OPODIS.2023.24</a>
</li>
<li>
<span class="authors">Alfredo Navarra and Francesco Piselli</span>
<span class="title">Silent Programmable Matter: Coating</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.25">10.4230/LIPIcs.OPODIS.2023.25</a>
</li>
<li>
<span class="authors">Shay Kutten, Peter Robinson, and Ming Ming Tan</span>
<span class="title">Tight Bounds on the Message Complexity of Distributed Tree Verification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.26">10.4230/LIPIcs.OPODIS.2023.26</a>
</li>
<li>
<span class="authors">Eden Aldema Tshuva and Rotem Oshman</span>
<span class="title">On Polynomial Time Local Decision</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.27">10.4230/LIPIcs.OPODIS.2023.27</a>
</li>
<li>
<span class="authors">Paola Flocchini, Nicola Santoro, Yuichi Sudo, and Koichi Wada</span>
<span class="title">On Asynchrony, Memory, and Communication: Separations and Landscapes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.28">10.4230/LIPIcs.OPODIS.2023.28</a>
</li>
<li>
<span class="authors">Ittai Abraham, Naama Ben-David, Gilad Stern, and Sravya Yandamuri</span>
<span class="title">On the Round Complexity of Asynchronous Crusader Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.29">10.4230/LIPIcs.OPODIS.2023.29</a>
</li>
<li>
<span class="authors">Avinandan Das, Pierre Fraigniaud, and Adi Rosén</span>
<span class="title">Distributed Partial Coloring via Gradual Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.30">10.4230/LIPIcs.OPODIS.2023.30</a>
</li>
<li>
<span class="authors">João Paulo Bezerra and Petr Kuznetsov</span>
<span class="title">A Tight Bound on Multiple Spending in Decentralized Cryptocurrencies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.31">10.4230/LIPIcs.OPODIS.2023.31</a>
</li>
<li>
<span class="authors">Hagit Attiya and Jennifer L. Welch</span>
<span class="title">Bounds on Worst-Case Responsiveness for Agreement Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.32">10.4230/LIPIcs.OPODIS.2023.32</a>
</li>
<li>
<span class="authors">Giuseppe A. Di Luna, Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro</span>
<span class="title">Black Hole Search in Dynamic Rings: The Scattered Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.33">10.4230/LIPIcs.OPODIS.2023.33</a>
</li>
<li>
<span class="authors">Rana Shahout and Roy Friedman</span>
<span class="title">Sketching the Path to Efficiency: Lightweight Learned Cache Replacement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.34">10.4230/LIPIcs.OPODIS.2023.34</a>
</li>
<li>
<span class="authors">Vincent Kowalski, Achour Mostéfaoui, and Matthieu Perrin</span>
<span class="title">Atomic Register Abstractions for Byzantine-Prone Distributed Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2023.35">10.4230/LIPIcs.OPODIS.2023.35</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