<h2>LIPIcs, Volume 324, OPODIS 2024</h2>
<ul>
<li>
<span class="authors">Silvia Bonomi, Letterio Galletta, Etienne Rivière, and Valerio Schiavoni</span>
<span class="title">LIPIcs, Volume 324, OPODIS 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024">10.4230/LIPIcs.OPODIS.2024</a>
</li>
<li>
<span class="authors">Silvia Bonomi, Letterio Galletta, Etienne Rivière, and Valerio Schiavoni</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.0">10.4230/LIPIcs.OPODIS.2024.0</a>
</li>
<li>
<span class="authors">Alysson Bessani</span>
<span class="title">The Power of Simplicity on Dependable Distributed Systems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.1">10.4230/LIPIcs.OPODIS.2024.1</a>
</li>
<li>
<span class="authors">Paola Flocchini</span>
<span class="title">Distributed Computing by Mobile Robots: Expanding the Horizon (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.2">10.4230/LIPIcs.OPODIS.2024.2</a>
</li>
<li>
<span class="authors">Alberto Sonnino</span>
<span class="title">BFT Consensus: From Academic Paper to Mainnet (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.3">10.4230/LIPIcs.OPODIS.2024.3</a>
</li>
<li>
<span class="authors">Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou, Mathieu Gestin, Nicolas Nicolaou, and Junlang Wang</span>
<span class="title">AMECOS: A Modular Event-Based Framework for Concurrent Object Specification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.4">10.4230/LIPIcs.OPODIS.2024.4</a>
</li>
<li>
<span class="authors">Sahil Dhoked, Ahmed Fahmy, Wojciech Golab, and Neeraj Mittal</span>
<span class="title">RMR-Efficient Detectable Objects for Persistent Memory and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.5">10.4230/LIPIcs.OPODIS.2024.5</a>
</li>
<li>
<span class="authors">Ahmed Fahmy and Wojciech Golab</span>
<span class="title">DULL: A Fast Scalable Detectable Unrolled Lock-Based Linked List</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.6">10.4230/LIPIcs.OPODIS.2024.6</a>
</li>
<li>
<span class="authors">Ulysse Pavloff, Yackolley Amoussou-Guenou, and Sara Tucci-Piergiovanni</span>
<span class="title">Incentive Compatibility of Ethereum’s PoS Consensus Protocol</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.7">10.4230/LIPIcs.OPODIS.2024.7</a>
</li>
<li>
<span class="authors">Kenan Wood, Hammurabi Mendes, and Jonad Pulaj</span>
<span class="title">Optimal Multilevel Slashing for Blockchains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.8">10.4230/LIPIcs.OPODIS.2024.8</a>
</li>
<li>
<span class="authors">Quentin Bramas, Toshimitsu Masuzawa, and Sébastien Tixeuil</span>
<span class="title">Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.9">10.4230/LIPIcs.OPODIS.2024.9</a>
</li>
<li>
<span class="authors">Giuseppe A. Di Luna and Giovanni Viglietta</span>
<span class="title">Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.10">10.4230/LIPIcs.OPODIS.2024.10</a>
</li>
<li>
<span class="authors">Younan Gao and Andrzej Pelc</span>
<span class="title">Gathering Teams of Deterministic Finite Automata on a Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.11">10.4230/LIPIcs.OPODIS.2024.11</a>
</li>
<li>
<span class="authors">Fukuhito Ooshita, Naoki Kitamura, Ryota Eguchi, Michiko Inoue, Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, and Yuichi Sudo</span>
<span class="title">Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.12">10.4230/LIPIcs.OPODIS.2024.12</a>
</li>
<li>
<span class="authors">Raphael Gerlach, Sören von der Gracht, Christopher Hahn, Jonas Harbig, and Peter Kling</span>
<span class="title">Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.13">10.4230/LIPIcs.OPODIS.2024.13</a>
</li>
<li>
<span class="authors">Timothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, and Vassilis Zikas</span>
<span class="title">Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.14">10.4230/LIPIcs.OPODIS.2024.14</a>
</li>
<li>
<span class="authors">Mose Mizrahi Erbes and Roger Wattenhofer</span>
<span class="title">Quit-Resistant Reliable Broadcast and Efficient Terminating Gather</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.15">10.4230/LIPIcs.OPODIS.2024.15</a>
</li>
<li>
<span class="authors">Thomas Locher</span>
<span class="title">Byzantine Reliable Broadcast with Low Communication and Time Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.16">10.4230/LIPIcs.OPODIS.2024.16</a>
</li>
<li>
<span class="authors">Pritam Goswami, Adri Bhattacharya, Raja Das, and Partha Sarathi Mandal</span>
<span class="title">Perpetual Exploration of a Ring in Presence of Byzantine Black Hole</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.17">10.4230/LIPIcs.OPODIS.2024.17</a>
</li>
<li>
<span class="authors">Stephan Felber and Hugo Rincon Galeana</span>
<span class="title">Stabilizing Consensus Is Impossible in Lossy Iterated Immediate Snapshot Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.18">10.4230/LIPIcs.OPODIS.2024.18</a>
</li>
<li>
<span class="authors">Yusong Shi and Weidong Liu</span>
<span class="title">A General Class of Reductions and Extension-Based Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.19">10.4230/LIPIcs.OPODIS.2024.19</a>
</li>
<li>
<span class="authors">Nenad Milošević, Daniel Cason, Zarko Milošević, and Fernando Pedone</span>
<span class="title">How Robust Are Synchronous Consensus Protocols?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.20">10.4230/LIPIcs.OPODIS.2024.20</a>
</li>
<li>
<span class="authors">Sylvain Gay, Achour Mostéfaoui, and Matthieu Perrin</span>
<span class="title">No Symmetric Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.21">10.4230/LIPIcs.OPODIS.2024.21</a>
</li>
<li>
<span class="authors">Mathieu Bacou</span>
<span class="title">FaaSLoad: Fine-Grained Performance and Resource Measurement for Function-As-a-Service</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.22">10.4230/LIPIcs.OPODIS.2024.22</a>
</li>
<li>
<span class="authors">Diana Cohen, Roy Friedman, and Rana Shahout</span>
<span class="title">Distributed Recoverable Sketches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.23">10.4230/LIPIcs.OPODIS.2024.23</a>
</li>
<li>
<span class="authors">Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, and Stefan Schmid</span>
<span class="title">Hash & Adjust: Competitive Demand-Aware Consistent Hashing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.24">10.4230/LIPIcs.OPODIS.2024.24</a>
</li>
<li>
<span class="authors">Rowdy Chotkan, Bart Cox, Vincent Rahli, and Jérémie Decouchant</span>
<span class="title">Reliable Communication in Hybrid Authentication and Trust Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.25">10.4230/LIPIcs.OPODIS.2024.25</a>
</li>
<li>
<span class="authors">Fabien Dufoulon, Gopal Pandurangan, Peter Robinson, and Michele Scquizzato</span>
<span class="title">The Singular Optimality of Distributed Computation in LOCAL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.26">10.4230/LIPIcs.OPODIS.2024.26</a>
</li>
<li>
<span class="authors">Anubhav Dhar, Eli Kujawa, Henrik Lievonen, Augusto Modanese, Mikail Muftuoglu, Jan Studený, and Jukka Suomela</span>
<span class="title">Local Problems in Trees Across a Wide Range of Distributed Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.27">10.4230/LIPIcs.OPODIS.2024.27</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Laurent Feuilloley, and Théo Pierron</span>
<span class="title">How Local Constraints Influence Network Diameter and Applications to LCL Generalizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.28">10.4230/LIPIcs.OPODIS.2024.28</a>
</li>
<li>
<span class="authors">Jacek Cichoń, Dawid Dworzański, and Karol Gotfryd</span>
<span class="title">On Reliability of the Extrema Propagation Technique in Random Environment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.29">10.4230/LIPIcs.OPODIS.2024.29</a>
</li>
<li>
<span class="authors">Juho Hirvonen and Sara Ranjbaran</span>
<span class="title">Fast, Fair and Truthful Distributed Stable Matching for Common Preferences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.30">10.4230/LIPIcs.OPODIS.2024.30</a>
</li>
<li>
<span class="authors">João Paulo Bezerra, Veronika Anikina, Petr Kuznetsov, Liron Schiff, and Stefan Schmid</span>
<span class="title">Dynamic Probabilistic Reliable Broadcast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.31">10.4230/LIPIcs.OPODIS.2024.31</a>
</li>
<li>
<span class="authors">Kenan Wood, Hammurabi Mendes, and Jonad Pulaj</span>
<span class="title">Distributed Agreement in the Arrovian Framework</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.32">10.4230/LIPIcs.OPODIS.2024.32</a>
</li>
<li>
<span class="authors">Shimon Bitton, Yuval Emek, Taisuke Izumi, and Shay Kutten</span>
<span class="title">Self-Stabilizing Fully Adaptive Maximal Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.33">10.4230/LIPIcs.OPODIS.2024.33</a>
</li>
<li>
<span class="authors">François Le Gall, Oran Nadler, Harumichi Nishimura, and Rotem Oshman</span>
<span class="title">Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.34">10.4230/LIPIcs.OPODIS.2024.34</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel and Einav Huberman</span>
<span class="title">Near-Optimal Resilient Labeling Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.35">10.4230/LIPIcs.OPODIS.2024.35</a>
</li>
<li>
<span class="authors">Vijeth Aradhya, Seth Gilbert, and Thorsten Götte</span>
<span class="title">Distributed Branching Random Walks and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.36">10.4230/LIPIcs.OPODIS.2024.36</a>
</li>
<li>
<span class="authors">Haruki Kanaya, Ryota Eguchi, Taisho Sasada, and Michiko Inoue</span>
<span class="title">Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.37">10.4230/LIPIcs.OPODIS.2024.37</a>
</li>
<li>
<span class="authors">Aleksander Figiel, Janne H. Korhonen, Neil Olver, and Stefan Schmid</span>
<span class="title">Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.38">10.4230/LIPIcs.OPODIS.2024.38</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