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