<h2>LIPIcs, Volume 281, DISC 2023</h2>
<ul>
<li>
<span class="authors">Rotem Oshman</span>
<span class="title">LIPIcs, Volume 281, DISC 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023">10.4230/LIPIcs.DISC.2023</a>
</li>
<li>
<span class="authors">Rotem Oshman</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.0">10.4230/LIPIcs.DISC.2023.0</a>
</li>
<li>
<span class="authors">Ittai Abraham, Danny Dolev, Ittay Eyal, and Joseph Y. Halpern</span>
<span class="title">Colordag: An Incentive-Compatible Blockchain</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.1">10.4230/LIPIcs.DISC.2023.1</a>
</li>
<li>
<span class="authors">Karine Altisen, Pierre Corbineau, and Stéphane Devismes</span>
<span class="title">Certified Round Complexity of Self-Stabilizing Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.2">10.4230/LIPIcs.DISC.2023.2</a>
</li>
<li>
<span class="authors">Ananya Appan, Anirudh Chandramouli, and Ashish Choudhury</span>
<span class="title">Network Agnostic Perfectly Secure MPC Against General Adversaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.3">10.4230/LIPIcs.DISC.2023.3</a>
</li>
<li>
<span class="authors">Hagit Attiya, Pierre Fraigniaud, Ami Paz, and Sergio Rajsbaum</span>
<span class="title">One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.4">10.4230/LIPIcs.DISC.2023.4</a>
</li>
<li>
<span class="authors">Hagit Attiya, Armando Castañeda, and Thomas Nowak</span>
<span class="title">Topological Characterization of Task Solvability in General Models of Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.5">10.4230/LIPIcs.DISC.2023.5</a>
</li>
<li>
<span class="authors">Sarah Azouvi, Guy Goren, Lioba Heimbach, and Alexander Hicks</span>
<span class="title">Base Fee Manipulation in Ethereum’s EIP-1559 Transaction Fee Mechanism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.6">10.4230/LIPIcs.DISC.2023.6</a>
</li>
<li>
<span class="authors">Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, and Gustav Schmid</span>
<span class="title">On the Node-Averaged Complexity of Locally Checkable Problems on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.7">10.4230/LIPIcs.DISC.2023.7</a>
</li>
<li>
<span class="authors">Evangelos Bampas, Joffroy Beauquier, Janna Burman, and William Guy--Obé</span>
<span class="title">Treasure Hunt with Volatile Pheromones</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.8">10.4230/LIPIcs.DISC.2023.8</a>
</li>
<li>
<span class="authors">Naama Ben-David, Gal Sela, and Adriana Szekeres</span>
<span class="title">The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.9">10.4230/LIPIcs.DISC.2023.9</a>
</li>
<li>
<span class="authors">Erica Blum, Elette Boyle, Ran Cohen, and Chen-Da Liu-Zhang</span>
<span class="title">Communication Lower Bounds for Cryptographic Broadcast Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.10">10.4230/LIPIcs.DISC.2023.10</a>
</li>
<li>
<span class="authors">Mélanie Cambus, Fabian Kuhn, Shreyas Pai, and Jara Uitto</span>
<span class="title">Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.11">10.4230/LIPIcs.DISC.2023.11</a>
</li>
<li>
<span class="authors">Bernadette Charron-Bost and Louis Penet de Monterno</span>
<span class="title">Self-Stabilizing Clock Synchronization in Probabilistic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.12">10.4230/LIPIcs.DISC.2023.12</a>
</li>
<li>
<span class="authors">Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, and Manuel Vidigueira</span>
<span class="title">Every Bit Counts in Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.13">10.4230/LIPIcs.DISC.2023.13</a>
</li>
<li>
<span class="authors">Romain Cosson, Laurent Massoulié, and Laurent Viennot</span>
<span class="title">Efficient Collaborative Tree Exploration with Breadth-First Depth-Next</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.14">10.4230/LIPIcs.DISC.2023.14</a>
</li>
<li>
<span class="authors">Yannis Coutouly and Emmanuel Godard</span>
<span class="title">A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.15">10.4230/LIPIcs.DISC.2023.15</a>
</li>
<li>
<span class="authors">Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal</span>
<span class="title">Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.16">10.4230/LIPIcs.DISC.2023.16</a>
</li>
<li>
<span class="authors">Sahil Dhoked, Wojciech Golab, and Neeraj Mittal</span>
<span class="title">Modular Recoverable Mutual Exclusion Under System-Wide Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.17">10.4230/LIPIcs.DISC.2023.17</a>
</li>
<li>
<span class="authors">Giuseppe A. Di Luna and Giovanni Viglietta</span>
<span class="title">Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.18">10.4230/LIPIcs.DISC.2023.18</a>
</li>
<li>
<span class="authors">Maxime Flin, Magnús M. Halldórsson, and Alexandre Nolin</span>
<span class="title">Fast Coloring Despite Congested Relays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.19">10.4230/LIPIcs.DISC.2023.19</a>
</li>
<li>
<span class="authors">Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, and Ioan Todinca</span>
<span class="title">Distributed Certification for Classes of Dense Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.20">10.4230/LIPIcs.DISC.2023.20</a>
</li>
<li>
<span class="authors">Davide Frey, Mathieu Gestin, and Michel Raynal</span>
<span class="title">The Synchronization Power (Consensus Number) of Access-Control Objects: the Case of AllowList and DenyList</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.21">10.4230/LIPIcs.DISC.2023.21</a>
</li>
<li>
<span class="authors">Marc Fuchs and Fabian Kuhn</span>
<span class="title">List Defective Colorings: Distributed Algorithms and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.22">10.4230/LIPIcs.DISC.2023.22</a>
</li>
<li>
<span class="authors">Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, and Jara Uitto</span>
<span class="title">Conditionally Optimal Parallel Coloring of Forests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.23">10.4230/LIPIcs.DISC.2023.23</a>
</li>
<li>
<span class="authors">Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafael Pinot, and Sasha Voitovych</span>
<span class="title">On the Inherent Anonymity of Gossiping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.24">10.4230/LIPIcs.DISC.2023.24</a>
</li>
<li>
<span class="authors">Prasad Jayanti, Siddhartha Jayanti, and Sucharita Jayanti</span>
<span class="title">Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.25">10.4230/LIPIcs.DISC.2023.25</a>
</li>
<li>
<span class="authors">Idit Keidar, Oded Naor, Ouri Poupko, and Ehud Shapiro</span>
<span class="title">Cordial Miners: Fast and Efficient Consensus for Every Eventuality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.26">10.4230/LIPIcs.DISC.2023.26</a>
</li>
<li>
<span class="authors">Irina Kostitsyna, Tom Peters, and Bettina Speckmann</span>
<span class="title">Fast Reconfiguration for Programmable Matter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.27">10.4230/LIPIcs.DISC.2023.27</a>
</li>
<li>
<span class="authors">Xiao Li, Eric Chan, and Mohsen Lesani</span>
<span class="title">Quorum Subsumption for Heterogeneous Quorum Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.28">10.4230/LIPIcs.DISC.2023.28</a>
</li>
<li>
<span class="authors">Avery Miller and Andrzej Pelc</span>
<span class="title">Fast Deterministic Rendezvous in Labeled Lines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.29">10.4230/LIPIcs.DISC.2023.29</a>
</li>
<li>
<span class="authors">Raïssa Nataf, Guy Goren, and Yoram Moses</span>
<span class="title">Null Messages, Information and Coordination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.30">10.4230/LIPIcs.DISC.2023.30</a>
</li>
<li>
<span class="authors">Youer Pu, Ali Farahbakhsh, Lorenzo Alvisi, and Ittay Eyal</span>
<span class="title">Gorilla: Safe Permissionless Byzantine Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.31">10.4230/LIPIcs.DISC.2023.31</a>
</li>
<li>
<span class="authors">Peter Robinson</span>
<span class="title">Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.32">10.4230/LIPIcs.DISC.2023.32</a>
</li>
<li>
<span class="authors">Gadi Taubenfeld</span>
<span class="title">Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.33">10.4230/LIPIcs.DISC.2023.33</a>
</li>
<li>
<span class="authors">Anh Tran and Edward Talmage</span>
<span class="title">Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.34">10.4230/LIPIcs.DISC.2023.34</a>
</li>
<li>
<span class="authors">Vitaly Aksenov, Michael Anoprenko, Alexander Fedorov, and Michael Spear</span>
<span class="title">Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.35">10.4230/LIPIcs.DISC.2023.35</a>
</li>
<li>
<span class="authors">Hagit Attiya and Jennifer L. Welch</span>
<span class="title">Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.36">10.4230/LIPIcs.DISC.2023.36</a>
</li>
<li>
<span class="authors">Michael Chen, A. Pavan, and N. V. Vinodchandran</span>
<span class="title">Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.37">10.4230/LIPIcs.DISC.2023.37</a>
</li>
<li>
<span class="authors">Jakeb Chouinard, Kush Kansara, Xialin Liu, Nihal Potdar, and Wojciech Golab</span>
<span class="title">Brief Announcement: On Implementing Wear Leveling in Persistent Synchronization Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.38">10.4230/LIPIcs.DISC.2023.38</a>
</li>
<li>
<span class="authors">Shir Cohen and Idit Keidar</span>
<span class="title">Brief Announcement: Subquadratic Multivalued Asynchronous Byzantine Agreement WHP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.39">10.4230/LIPIcs.DISC.2023.39</a>
</li>
<li>
<span class="authors">Sameep Dahal, Francesco d'Amore, Henrik Lievonen, Timothé Picavet, and Jukka Suomela</span>
<span class="title">Brief Announcement: Distributed Derandomization Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.40">10.4230/LIPIcs.DISC.2023.40</a>
</li>
<li>
<span class="authors">Eli Gafni and Giuliano Losa</span>
<span class="title">Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.41">10.4230/LIPIcs.DISC.2023.41</a>
</li>
<li>
<span class="authors">Yuval Gelles and Ilan Komargodski</span>
<span class="title">Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.42">10.4230/LIPIcs.DISC.2023.42</a>
</li>
<li>
<span class="authors">Marc Leinweber and Hannes Hartenstein</span>
<span class="title">Brief Announcement: Let It TEE: Asynchronous Byzantine Atomic Broadcast with n ≥ 2f+1</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.43">10.4230/LIPIcs.DISC.2023.43</a>
</li>
<li>
<span class="authors">Tomer Lev Lehman, Hagit Attiya, and Danny Hendler</span>
<span class="title">Brief Announcement: Recoverable and Detectable Self-Implementations of Swap</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.44">10.4230/LIPIcs.DISC.2023.44</a>
</li>
<li>
<span class="authors">Alfredo Navarra and Francesco Piselli</span>
<span class="title">Brief Announcement: Line Formation in Silent Programmable Matter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.45">10.4230/LIPIcs.DISC.2023.45</a>
</li>
<li>
<span class="authors">Sean Ovens</span>
<span class="title">Brief Announcement: The Space Complexity of Set Agreement Using Swap</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.46">10.4230/LIPIcs.DISC.2023.46</a>
</li>
<li>
<span class="authors">Ehud Shapiro</span>
<span class="title">Brief Announcement: Grassroots Distributed Systems: Concept, Examples, Implementation and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2023.47">10.4230/LIPIcs.DISC.2023.47</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