<h2>LIPIcs, Volume 319, DISC 2024</h2>
<ul>
<li>
<span class="authors">Dan Alistarh</span>
<span class="title">LIPIcs, Volume 319, DISC 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024">10.4230/LIPIcs.DISC.2024</a>
</li>
<li>
<span class="authors">Dan Alistarh</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.0">10.4230/LIPIcs.DISC.2024.0</a>
</li>
<li>
<span class="authors">Eden Aldema Tshuva and Rotem Oshman</span>
<span class="title">Fully Local Succinct Distributed Arguments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.1">10.4230/LIPIcs.DISC.2024.1</a>
</li>
<li>
<span class="authors">Kaya Alpturer, Joseph Y. Halpern, and Ron van der Meyden</span>
<span class="title">A Knowledge-Based Analysis of Intersection Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.2">10.4230/LIPIcs.DISC.2024.2</a>
</li>
<li>
<span class="authors">John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, and Aishwarya Thiruvengadam</span>
<span class="title">Byzantine Resilient Distributed Computing on External Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.3">10.4230/LIPIcs.DISC.2024.3</a>
</li>
<li>
<span class="authors">Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, and Chaodong Zheng</span>
<span class="title">Almost Optimal Algorithms for Token Collision in Anonymous Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.4">10.4230/LIPIcs.DISC.2024.4</a>
</li>
<li>
<span class="authors">Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, and Mikaël Rabie</span>
<span class="title">Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.5">10.4230/LIPIcs.DISC.2024.5</a>
</li>
<li>
<span class="authors">Leonid Barenboim and Uri Goldenberg</span>
<span class="title">Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.6">10.4230/LIPIcs.DISC.2024.6</a>
</li>
<li>
<span class="authors">Benyamin Bashari, David Yu Cheng Chan, and Philipp Woelfel</span>
<span class="title">A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.7">10.4230/LIPIcs.DISC.2024.7</a>
</li>
<li>
<span class="authors">Yoav Ben Shimon, Ori Lahav, and Sharon Shoham</span>
<span class="title">Hyperproperty-Preserving Register Specifications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.8">10.4230/LIPIcs.DISC.2024.8</a>
</li>
<li>
<span class="authors">Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, and Nicolas Hanusse</span>
<span class="title">Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.9">10.4230/LIPIcs.DISC.2024.9</a>
</li>
<li>
<span class="authors">Manuel Bravo, Gregory Chockler, Alexey Gotsman, Alejandro Naser-Pastoriza, and Christian Roldán</span>
<span class="title">Vertical Atomic Broadcast and Passive Replication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.10">10.4230/LIPIcs.DISC.2024.10</a>
</li>
<li>
<span class="authors">Armando Castañeda, Gregory Chockler, Brijesh Dongol, and Ori Lahav</span>
<span class="title">What Cannot Be Implemented on Weak Memory?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.11">10.4230/LIPIcs.DISC.2024.11</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Tomer Even, and Virginia Vassilevska Williams</span>
<span class="title">Faster Cycle Detection in the Congested Clique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.12">10.4230/LIPIcs.DISC.2024.12</a>
</li>
<li>
<span class="authors">Jérémie Chalopin, Shantanu Das, and Maria Kokkou</span>
<span class="title">Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.13">10.4230/LIPIcs.DISC.2024.13</a>
</li>
<li>
<span class="authors">Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, and Igor Zablotchi</span>
<span class="title">Efficient Signature-Free Validated Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.14">10.4230/LIPIcs.DISC.2024.14</a>
</li>
<li>
<span class="authors">Andrei Constantinescu, Diana Ghinea, Roger Wattenhofer, and Floris Westermann</span>
<span class="title">Convex Consensus with Asynchronous Fallback</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.15">10.4230/LIPIcs.DISC.2024.15</a>
</li>
<li>
<span class="authors">Yannis Coutouly and Emmanuel Godard</span>
<span class="title">A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.16">10.4230/LIPIcs.DISC.2024.16</a>
</li>
<li>
<span class="authors">Philipp Czerner</span>
<span class="title">Breaking Through the Ω(n)-Space Barrier: Population Protocols Decide Double-Exponential Thresholds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.17">10.4230/LIPIcs.DISC.2024.17</a>
</li>
<li>
<span class="authors">Niccolò D'Archivio and Robin Vacus</span>
<span class="title">On the Limits of Information Spread by Memory-Less Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.18">10.4230/LIPIcs.DISC.2024.18</a>
</li>
<li>
<span class="authors">Laxman Dhulipala, Michael Dinitz, Jakub Łącki, and Slobodan Mitrović</span>
<span class="title">Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.19">10.4230/LIPIcs.DISC.2024.19</a>
</li>
<li>
<span class="authors">David Doty and Ben Heckmann</span>
<span class="title">The Computational Power of Discrete Chemical Reaction Networks with Bounded Executions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.20">10.4230/LIPIcs.DISC.2024.20</a>
</li>
<li>
<span class="authors">Antoine El-Hayek, Monika Henzinger, and Stefan Schmid</span>
<span class="title">Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.21">10.4230/LIPIcs.DISC.2024.21</a>
</li>
<li>
<span class="authors">Yuval Emek, Yuval Gil, and Noga Harlev</span>
<span class="title">On the Power of Graphical Reconfigurable Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.22">10.4230/LIPIcs.DISC.2024.22</a>
</li>
<li>
<span class="authors">Panagiota Fatourou and Eric Ruppert</span>
<span class="title">Lock-Free Augmented Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.23">10.4230/LIPIcs.DISC.2024.23</a>
</li>
<li>
<span class="authors">Maxime Flin, Magnús M. Halldórsson, and Alexandre Nolin</span>
<span class="title">Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.24">10.4230/LIPIcs.DISC.2024.24</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, and Ioan Todinca</span>
<span class="title">Distributed Model Checking on Graphs of Bounded Treedepth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.25">10.4230/LIPIcs.DISC.2024.25</a>
</li>
<li>
<span class="authors">Fabian Frei, Ran Gelles, Ahmed Ghazy, and Alexandre Nolin</span>
<span class="title">Content-Oblivious Leader Election on Rings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.26">10.4230/LIPIcs.DISC.2024.26</a>
</li>
<li>
<span class="authors">Ran Gelles, Zvi Lotker, and Frederik Mallmann-Trenn</span>
<span class="title">Sorting in One and Two Rounds Using t-Comparators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.27">10.4230/LIPIcs.DISC.2024.27</a>
</li>
<li>
<span class="authors">George Giakkoupis, Volker Turau, and Isabella Ziccardi</span>
<span class="title">Self-Stabilizing MIS Computation in the Beeping Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.28">10.4230/LIPIcs.DISC.2024.28</a>
</li>
<li>
<span class="authors">Jeff Giliberti and Zahra Parsaeian</span>
<span class="title">Massively Parallel Ruling Set Made Deterministic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.29">10.4230/LIPIcs.DISC.2024.29</a>
</li>
<li>
<span class="authors">Neil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, and Ling Ren</span>
<span class="title">Granular Synchrony</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.30">10.4230/LIPIcs.DISC.2024.30</a>
</li>
<li>
<span class="authors">Magnús M. Halldórsson and Yannic Maus</span>
<span class="title">Distributed Delta-Coloring Under Bandwidth Limitations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.31">10.4230/LIPIcs.DISC.2024.31</a>
</li>
<li>
<span class="authors">Longcheng Li, Xiaoming Sun, and Jiadong Zhu</span>
<span class="title">Quantum Byzantine Agreement Against Full-Information Adversary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.32">10.4230/LIPIcs.DISC.2024.32</a>
</li>
<li>
<span class="authors">Raïssa Nataf and Yoram Moses</span>
<span class="title">Communication Requirements for Linearizable Registers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.33">10.4230/LIPIcs.DISC.2024.33</a>
</li>
<li>
<span class="authors">Shunhao Oh, Joseph L. Briones, Jacob Calvert, Noah Egan, Dana Randall, and Andréa W. Richa</span>
<span class="title">Single Bridge Formation in Self-Organizing Particle Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.34">10.4230/LIPIcs.DISC.2024.34</a>
</li>
<li>
<span class="authors">Garrett Parzych and Joshua J. Daymude</span>
<span class="title">Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.35">10.4230/LIPIcs.DISC.2024.35</a>
</li>
<li>
<span class="authors">Asaf Petruschka, Shay Spair, and Elad Tzalik</span>
<span class="title">Connectivity Labeling in Faulty Colored Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.36">10.4230/LIPIcs.DISC.2024.36</a>
</li>
<li>
<span class="authors">Victor Shoup</span>
<span class="title">Sing a Song of Simplex</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.37">10.4230/LIPIcs.DISC.2024.37</a>
</li>
<li>
<span class="authors">Yuichi Sudo, Masahiro Shibata, Junya Nakamura, Yonghwan Kim, and Toshimitsu Masuzawa</span>
<span class="title">Near-Linear Time Dispersion of Mobile Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.38">10.4230/LIPIcs.DISC.2024.38</a>
</li>
<li>
<span class="authors">Qinzi Zhang and Lewis Tseng</span>
<span class="title">The Power of Abstract MAC Layer: A Fault-Tolerance Perspective</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.39">10.4230/LIPIcs.DISC.2024.39</a>
</li>
<li>
<span class="authors">Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, and Oren Weimann</span>
<span class="title">Brief Announcement: Distributed Maximum Flow in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.40">10.4230/LIPIcs.DISC.2024.40</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">Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.41">10.4230/LIPIcs.DISC.2024.41</a>
</li>
<li>
<span class="authors">Hagit Attiya, Pierre Fraigniaud, Ami Paz, and Sergio Rajsbaum</span>
<span class="title">Brief Announcement: Solvability of Three-Process General Tasks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.42">10.4230/LIPIcs.DISC.2024.42</a>
</li>
<li>
<span class="authors">Andrei Constantinescu, Diana Ghinea, Jakub Sliwinski, and Roger Wattenhofer</span>
<span class="title">Brief Announcement: Unifying Partial Synchrony</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.43">10.4230/LIPIcs.DISC.2024.43</a>
</li>
<li>
<span class="authors">Philipp Czerner, Vincent Fischer, and Roland Guttenberg</span>
<span class="title">Brief Announcement: The Expressive Power of Uniform Population Protocols with Logarithmic Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.44">10.4230/LIPIcs.DISC.2024.44</a>
</li>
<li>
<span class="authors">Lei Fan, Jonathan Katz, Zhenghao Lu, Phuc Thai, and Hong-Sheng Zhou</span>
<span class="title">Brief Announcement: Best-Possible Unpredictable Proof-Of-Stake</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.45">10.4230/LIPIcs.DISC.2024.45</a>
</li>
<li>
<span class="authors">Caterina Feletti, Debasish Pattanayak, and Gokarna Sharma</span>
<span class="title">Brief Announcement: Optimal Uniform Circle Formation by Asynchronous Luminous Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.46">10.4230/LIPIcs.DISC.2024.46</a>
</li>
<li>
<span class="authors">Pierre Fraigniaud, Minh Hang Nguyen, and Ami Paz</span>
<span class="title">Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.47">10.4230/LIPIcs.DISC.2024.47</a>
</li>
<li>
<span class="authors">Fabian Frei and Koichi Wada</span>
<span class="title">Brief Announcement: Distinct Gathering Under Round Robin</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.48">10.4230/LIPIcs.DISC.2024.48</a>
</li>
<li>
<span class="authors">Jan Matyáš Křišťan and Josef Erik Sedláček</span>
<span class="title">Brief Announcement: Decreasing Verification Radius in Local Certification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.49">10.4230/LIPIcs.DISC.2024.49</a>
</li>
<li>
<span class="authors">Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, and Gokarna Sharma</span>
<span class="title">Brief Announcement: Agent-Based Leader Election, MST, and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.50">10.4230/LIPIcs.DISC.2024.50</a>
</li>
<li>
<span class="authors">Christoph Lenzen and Shreyas Srinivas</span>
<span class="title">Brief Announcement: Clock Distribution with Gradient TRIX</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.51">10.4230/LIPIcs.DISC.2024.51</a>
</li>
<li>
<span class="authors">Xiao Li and Mohsen Lesani</span>
<span class="title">Brief Announcement: Reconfigurable Heterogeneous Quorum Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.52">10.4230/LIPIcs.DISC.2024.52</a>
</li>
<li>
<span class="authors">Gal Sela and Erez Petrank</span>
<span class="title">Brief Announcement: Concurrent Aggregate Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.53">10.4230/LIPIcs.DISC.2024.53</a>
</li>
<li>
<span class="authors">Yusong Shi and Weidong Liu</span>
<span class="title">Brief Announcement: Colorless Tasks and Extension-Based Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.54">10.4230/LIPIcs.DISC.2024.54</a>
</li>
<li>
<span class="authors">Yuichi Sudo, Fukuhito Ooshita, and Sayaka Kamei</span>
<span class="title">Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2024.55">10.4230/LIPIcs.DISC.2024.55</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