Abstract is missing.
- Non-Blocking Doubly-Linked Lists with Good Amortized ComplexityNiloufar Shafiei. [doi]
- Maximum Matching for Anonymous Trees with Constant Space per ProcessAjoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa. [doi]
- Communicating with BeepsArtur Czumaj, Peter Davies. [doi]
- The Cost of Global Broadcast in Dynamic Radio NetworksMohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla. [doi]
- A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel AlgorithmsOrr Tamir, Adam Morrison, Noam Rinetzky. [doi]
- Distributed Sparse Cut ApproximationFabian Kuhn, Anisur Rahaman Molla. [doi]
- Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote)Alexander Spiegelman, Yuval Cassuto, Gregory V. Chockler, Idit Keidar. [doi]
- Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random NumbersYuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa. [doi]
- Analysis of Bounds on Hybrid Vector ClocksSorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Murat Demirbas. [doi]
- Robust Shared Objects for Non-Volatile Main MemoryRyan Berryhill, Wojciech Golab, Mahesh Tripunitara. [doi]
- A Faster Counting Protocol for Anonymous Dynamic NetworksAlessia Milani, Miguel A. Mosteiro. [doi]
- Nontrivial and Universal Helping for Wait-Free Queues and StacksHagit Attiya, Armando Castañeda, Danny Hendler. [doi]
- Towards Establishing Monotonic Searchability in Self-Stabilizing Data StructuresChristian Scheideler, Alexander Setzer, Thim Strothmann. [doi]
- Distributed Approximation of k-Service AssignmentMagnús M. Halldórsson, Sven Köhler 0002, Dror Rawitz. [doi]
- The Synchronization Power of Atomic Bitwise OperationsDamien Imbs. [doi]
- Bounds for Blind Rate AdaptationSeth Gilbert, Calvin C. Newport, Tonghe Wang. [doi]
- Ensuring Average Recovery with Adversarial SchedulerJingshu Chen, Mohammad Roohitavaf, Sandeep S. Kulkarni. [doi]
- Poly-Logarithmic Adaptive Algorithms Require Unconditional PrimitivesHagit Attiya, Arie Fouren. [doi]
- Anonymous Obstruction-Free (n, k)-Set Agreement with n-k+1 Atomic Read/Write RegistersZohir Bouzid, Michel Raynal, Pierre Sutra. [doi]
- Overcoming Obstacles with AntsTobias Langner, Barbara Keller, Jara Uitto, Roger Wattenhofer. [doi]
- Front Matter, Table of Contents, Preface, Committees, List of Authors [doi]
- The Benefits of Entropy in Population ProtocolsJoffroy Beauquier, Peva Blanchard, Janna Burman, Rachid Guerraoui. [doi]
- Atomic Snapshots from Small RegistersLeqi Zhu, Faith Ellen. [doi]
- On the Uncontended Complexity of Anonymous ConsensusClaire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani. [doi]
- Making "Fast" Atomic Operations Computationally TractableAntonio Fernández Anta, Nicolas C. Nicolaou, Alexandru Popa. [doi]
- Byzantine Agreement with Median ValidityDavid Stolz, Roger Wattenhofer. [doi]
- Time to Change: On Distributed Computing in Dynamic Networks (Keynote)Nicola Santoro. [doi]
- Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial)Michel Raynal. [doi]
- Dynamic Reconfiguration: A Tutorial (Tutorial)Alexander Spiegelman, Idit Keidar, Dahlia Malkhi. [doi]
- The Relative Power of Composite Loop Agreement TasksVikram Saraph, Maurice Herlihy. [doi]
- ActiveMonitor: Asynchronous Monitor Framework for Scalability and Multi-Object SynchronizationWei-Lun Hung, Himanshu Chauhan, Vijay K. Garg. [doi]
- Approximation of Distances and Shortest Paths in the Broadcast Congest CliqueStephan Holzer, Nathan Pinsker. [doi]
- Blockchain-Based Consensus (Keynote)Juan A. Garay. [doi]
- Wait-Free Concurrent Graph Objects with Dynamic TraversalsNikolaos D. Kallimanis, Eleni Kanellou. [doi]
- Generic Proofs of Consensus Numbers for Abstract Data TypesEdward Talmage, Jennifer L. Welch. [doi]
- QuickLex: A Fast Algorithm for Consistent Global States Enumeration of Distributed ComputationsYen-Jung Chang, Vijay K. Garg. [doi]
- Non Trivial Computations in Anonymous Dynamic NetworksGiuseppe Antonio Di Luna, Roberto Baldoni. [doi]