<h2>LIPIcs, Volume 209, DISC 2021</h2>
<ul>
<li>
<span class="authors">Seth Gilbert</span>
<span class="title">LIPIcs, Volume 209, DISC 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021">10.4230/LIPIcs.DISC.2021</a>
</li>
<li>
<span class="authors">Seth Gilbert</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.0">10.4230/LIPIcs.DISC.2021.0</a>
</li>
<li>
<span class="authors">Bernhard Haeupler</span>
<span class="title">The Quest for Universally-Optimal Distributed Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.1">10.4230/LIPIcs.DISC.2021.1</a>
</li>
<li>
<span class="authors">Dahlia Malkhi</span>
<span class="title">Tech Transfer Stories and Takeaways (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.2">10.4230/LIPIcs.DISC.2021.2</a>
</li>
<li>
<span class="authors">Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Dalia Papuc, Athanasios Xygkis, and Igor Zablotchi</span>
<span class="title">Frugal Byzantine Computing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.3">10.4230/LIPIcs.DISC.2021.3</a>
</li>
<li>
<span class="authors">Dan Alistarh, Rati Gelashvili, and Giorgi Nadiradze</span>
<span class="title">Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.4">10.4230/LIPIcs.DISC.2021.4</a>
</li>
<li>
<span class="authors">Ioannis Anagnostides and Themis Gouleakis</span>
<span class="title">Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.5">10.4230/LIPIcs.DISC.2021.5</a>
</li>
<li>
<span class="authors">Sepehr Assadi and Aditi Dudeja</span>
<span class="title">Ruling Sets in Random Order and Adversarial Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.6">10.4230/LIPIcs.DISC.2021.6</a>
</li>
<li>
<span class="authors">Hagit Attiya, Constantin Enea, and Jennifer L. Welch</span>
<span class="title">Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.7">10.4230/LIPIcs.DISC.2021.7</a>
</li>
<li>
<span class="authors">Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, and Jukka Suomela</span>
<span class="title">Locally Checkable Labelings with Small Messages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.8">10.4230/LIPIcs.DISC.2021.8</a>
</li>
<li>
<span class="authors">Gregor Bankhamer, Robert Elsässer, and Stefan Schmid</span>
<span class="title">Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.9">10.4230/LIPIcs.DISC.2021.9</a>
</li>
<li>
<span class="authors">Leonid Barenboim and Tzalik Maimon</span>
<span class="title">Deterministic Logarithmic Completeness in the Distributed Sleeping Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.10">10.4230/LIPIcs.DISC.2021.10</a>
</li>
<li>
<span class="authors">Denis Bédin, François Lépine, Achour Mostéfaoui, Damien Perez, and Matthieu Perrin</span>
<span class="title">Wait-Free CAS-Based Algorithms: The Burden of the Past</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.11">10.4230/LIPIcs.DISC.2021.11</a>
</li>
<li>
<span class="authors">Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, and Yuanhao Wei</span>
<span class="title">Space and Time Bounded Multiversion Garbage Collection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.12">10.4230/LIPIcs.DISC.2021.12</a>
</li>
<li>
<span class="authors">Marthe Bonamy, Linda Cook, Carla Groenland, and Alexandra Wesolek</span>
<span class="title">A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.13">10.4230/LIPIcs.DISC.2021.13</a>
</li>
<li>
<span class="authors">Wentao Cai, Haosen Wen, Vladimir Maksimovski, Mingzhe Du, Rafaello Sanna, Shreif Abdallah, and Michael L. Scott</span>
<span class="title">Fast Nonblocking Persistence for Concurrent Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.14">10.4230/LIPIcs.DISC.2021.14</a>
</li>
<li>
<span class="authors">Mélanie Cambus, Davin Choo, Havu Miikonen, and Jara Uitto</span>
<span class="title">Massively Parallel Correlation Clustering in Bounded Arboricity Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.15">10.4230/LIPIcs.DISC.2021.15</a>
</li>
<li>
<span class="authors">Armando Castañeda and Miguel Piña</span>
<span class="title">Fully Read/Write Fence-Free Work-Stealing with Multiplicity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.16">10.4230/LIPIcs.DISC.2021.16</a>
</li>
<li>
<span class="authors">Jinyuan Chen</span>
<span class="title">Optimal Error-Free Multi-Valued Byzantine Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.17">10.4230/LIPIcs.DISC.2021.17</a>
</li>
<li>
<span class="authors">Shir Cohen and Idit Keidar</span>
<span class="title">Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.18">10.4230/LIPIcs.DISC.2021.18</a>
</li>
<li>
<span class="authors">Varsha Dani, Aayush Gupta, Thomas P. Hayes, and Seth Pettie</span>
<span class="title">Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.19">10.4230/LIPIcs.DISC.2021.19</a>
</li>
<li>
<span class="authors">Joshua J. Daymude, Andréa W. Richa, and Christian Scheideler</span>
<span class="title">The Canonical Amoebot Model: Algorithms and Concurrency Control</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.20">10.4230/LIPIcs.DISC.2021.20</a>
</li>
<li>
<span class="authors">Michael Elkin, Yuval Gitlitz, and Ofer Neiman</span>
<span class="title">Improved Weighted Additive Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.21">10.4230/LIPIcs.DISC.2021.21</a>
</li>
<li>
<span class="authors">Adam Gańczorz, Tomasz Jurdziński, Mateusz Lewko, and Andrzej Pelc</span>
<span class="title">Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.22">10.4230/LIPIcs.DISC.2021.22</a>
</li>
<li>
<span class="authors">Yael Hitron and Merav Parter</span>
<span class="title">Broadcast CONGEST Algorithms against Adversarial Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.23">10.4230/LIPIcs.DISC.2021.23</a>
</li>
<li>
<span class="authors">Yael Hitron and Merav Parter</span>
<span class="title">General CONGEST Compilers against Adversarial Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.24">10.4230/LIPIcs.DISC.2021.24</a>
</li>
<li>
<span class="authors">Siddhartha Jayanti and Julian Shun</span>
<span class="title">Fast Arrays: Atomic Arrays with Constant Time Initialization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.25">10.4230/LIPIcs.DISC.2021.25</a>
</li>
<li>
<span class="authors">Muhammad Samir Khan and Nitin H. Vaidya</span>
<span class="title">Byzantine Consensus with Local Multicast Channels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.26">10.4230/LIPIcs.DISC.2021.26</a>
</li>
<li>
<span class="authors">Shay Kutten, William K. Moses Jr., Gopal Pandurangan, and David Peleg</span>
<span class="title">Singularly Near Optimal Leader Election in Asynchronous Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.27">10.4230/LIPIcs.DISC.2021.27</a>
</li>
<li>
<span class="authors">Petr Kuznetsov, Yvonne-Anne Pignolet, Pavel Ponomarev, and Andrei Tonkikh</span>
<span class="title">Permissionless and Asynchronous Asset Transfer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.28">10.4230/LIPIcs.DISC.2021.28</a>
</li>
<li>
<span class="authors">Nan Li and Wojciech Golab</span>
<span class="title">Detectable Sequential Specifications for Recoverable Shared Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.29">10.4230/LIPIcs.DISC.2021.29</a>
</li>
<li>
<span class="authors">Liat Maor and Gadi Taubenfeld</span>
<span class="title">Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.30">10.4230/LIPIcs.DISC.2021.30</a>
</li>
<li>
<span class="authors">Yannic Maus and Jara Uitto</span>
<span class="title">Efficient CONGEST Algorithms for the Lovász Local Lemma</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.31">10.4230/LIPIcs.DISC.2021.31</a>
</li>
<li>
<span class="authors">Atsuki Momose and Ling Ren</span>
<span class="title">Optimal Communication Complexity of Authenticated Byzantine Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.32">10.4230/LIPIcs.DISC.2021.32</a>
</li>
<li>
<span class="authors">Adir Morgan, Shay Solomon, and Nicole Wein</span>
<span class="title">Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.33">10.4230/LIPIcs.DISC.2021.33</a>
</li>
<li>
<span class="authors">Gregory Schwartzman and Yuichi Sudo</span>
<span class="title">Smoothed Analysis of Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.34">10.4230/LIPIcs.DISC.2021.34</a>
</li>
<li>
<span class="authors">Gali Sheffi, Maurice Herlihy, and Erez Petrank</span>
<span class="title">VBR: Version Based Reclamation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.35">10.4230/LIPIcs.DISC.2021.35</a>
</li>
<li>
<span class="authors">Yilun Sheng and Faith Ellen</span>
<span class="title">Extension-Based Proofs for Synchronous Message Passing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.36">10.4230/LIPIcs.DISC.2021.36</a>
</li>
<li>
<span class="authors">Lior Solodkin and Rotem Oshman</span>
<span class="title">Truthful Information Dissemination in General Asynchronous Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.37">10.4230/LIPIcs.DISC.2021.37</a>
</li>
<li>
<span class="authors">Alexander Spiegelman</span>
<span class="title">In Search for an Optimal Authenticated Byzantine Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.38">10.4230/LIPIcs.DISC.2021.38</a>
</li>
<li>
<span class="authors">Lili Su, Quanquan C. Liu, and Neha Narula</span>
<span class="title">The Power of Random Symmetry-Breaking in Nakamoto Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.39">10.4230/LIPIcs.DISC.2021.39</a>
</li>
<li>
<span class="authors">Yuichi Sudo, Ryota Eguchi, Taisuke Izumi, and Toshimitsu Masuzawa</span>
<span class="title">Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.40">10.4230/LIPIcs.DISC.2021.40</a>
</li>
<li>
<span class="authors">Ranjani G Sundaram, Himanshu Gupta, and C. R. Ramakrishnan</span>
<span class="title">Efficient Distribution of Quantum Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.41">10.4230/LIPIcs.DISC.2021.41</a>
</li>
<li>
<span class="authors">Paolo Zappalà, Marianna Belotti, Maria Potop-Butucaru, and Stefano Secci</span>
<span class="title">Game Theoretical Framework for Analyzing Blockchains Robustness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.42">10.4230/LIPIcs.DISC.2021.42</a>
</li>
<li>
<span class="authors">Dan Alistarh, Rati Gelashvili, and Joel Rybicki</span>
<span class="title">Brief Announcement: Fast Graphical Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.43">10.4230/LIPIcs.DISC.2021.43</a>
</li>
<li>
<span class="authors">Orestis Alpos, Christian Cachin, and Luca Zanolini</span>
<span class="title">Brief Announcement: How to Trust Strangers - Composition of Byzantine Quorum Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.44">10.4230/LIPIcs.DISC.2021.44</a>
</li>
<li>
<span class="authors">Gal Assa, Hagar Meir, Guy Golan-Gueta, Idit Keidar, and Alexander Spiegelman</span>
<span class="title">Brief Announcement: Using Nesting to Push the Limits of Transactional Data Structure Libraries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.45">10.4230/LIPIcs.DISC.2021.45</a>
</li>
<li>
<span class="authors">Shehar Bano, Alberto Sonnino, Andrey Chursin, Dmitri Perelman, Zekun Li, Avery Ching, and Dahlia Malkhi</span>
<span class="title">Brief Announcement: Twins – BFT Systems Made Robust</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.46">10.4230/LIPIcs.DISC.2021.46</a>
</li>
<li>
<span class="authors">Paul Bastide and Pierre Fraigniaud</span>
<span class="title">Brief Annoucement: On Extending Brandt’s Speedup Theorem from LOCAL to Round-Based Full-Information Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.47">10.4230/LIPIcs.DISC.2021.47</a>
</li>
<li>
<span class="authors">Shreesha G. Bhat and Kartik Nagar</span>
<span class="title">Brief Announcement: Automating and Mechanising Cutoff Proofs for Parameterized Verification of Distributed Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.48">10.4230/LIPIcs.DISC.2021.48</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Laurent Feuilloley, and Théo Pierron</span>
<span class="title">Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.49">10.4230/LIPIcs.DISC.2021.49</a>
</li>
<li>
<span class="authors">Sebastian Brandt, Rustam Latypov, and Jara Uitto</span>
<span class="title">Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.50">10.4230/LIPIcs.DISC.2021.50</a>
</li>
<li>
<span class="authors">Christian Cachin and Luca Zanolini</span>
<span class="title">Brief Announcement: Revisiting Signature-Free Asynchronous Byzantine Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.51">10.4230/LIPIcs.DISC.2021.51</a>
</li>
<li>
<span class="authors">Bapi Chatterjee, Sathya Peri, and Muktikanta Sa</span>
<span class="title">Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.52">10.4230/LIPIcs.DISC.2021.52</a>
</li>
<li>
<span class="authors">Vinicius Vielmo Cogo and Alysson Bessani</span>
<span class="title">Brief Announcement: Auditable Register Emulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.53">10.4230/LIPIcs.DISC.2021.53</a>
</li>
<li>
<span class="authors">Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, and Sara Tucci-Piergiovanni</span>
<span class="title">Brief Announcement: Accountability and Reconfiguration — Self-Healing Lattice Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.54">10.4230/LIPIcs.DISC.2021.54</a>
</li>
<li>
<span class="authors">John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim</span>
<span class="title">Brief Announcement: On Strong Observational Refinement and Forward Simulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.55">10.4230/LIPIcs.DISC.2021.55</a>
</li>
<li>
<span class="authors">Panagiota Fatourou, Nikolaos D. Kallimanis, and Eleftherios Kosmas</span>
<span class="title">Brief Announcement: Persistent Software Combining</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.56">10.4230/LIPIcs.DISC.2021.56</a>
</li>
<li>
<span class="authors">Guy Goren, Yoram Moses, and Alexander Spiegelman</span>
<span class="title">Brief Announcement: Probabilistic Indistinguishability and The Quality of Validity in Byzantine Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.57">10.4230/LIPIcs.DISC.2021.57</a>
</li>
<li>
<span class="authors">Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, and Jukka Suomela</span>
<span class="title">Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.58">10.4230/LIPIcs.DISC.2021.58</a>
</li>
<li>
<span class="authors">Ariel Livshits, Yonatan Shadmi, and Ran Tamir (Averbuch)</span>
<span class="title">Brief Announcement: Simple Majority Consensus in Networks with Unreliable Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.59">10.4230/LIPIcs.DISC.2021.59</a>
</li>
<li>
<span class="authors">Ruslan Nikolaev and Binoy Ravindran</span>
<span class="title">Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.60">10.4230/LIPIcs.DISC.2021.60</a>
</li>
<li>
<span class="authors">William Schultz, Siyuan Zhou, and Stavros Tripakis</span>
<span class="title">Brief Announcement: Design and Verification of a Logless Dynamic Reconfiguration Protocol in MongoDB Replication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.61">10.4230/LIPIcs.DISC.2021.61</a>
</li>
<li>
<span class="authors">Sravya Yandamuri, Ittai Abraham, Kartik Nayak, and Michael Reiter</span>
<span class="title">Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.62">10.4230/LIPIcs.DISC.2021.62</a>
</li>
<li>
<span class="authors">Pouriya Zarbafian and Vincent Gramoli</span>
<span class="title">Brief Announcement: Ordered Reliable Broadcast and Fast Ordered Byzantine Consensus for Cryptocurrency</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2021.63">10.4230/LIPIcs.DISC.2021.63</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