LIPIcs, Volume 209, DISC 2021

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