Abstract is missing.
- Collision-Free Pattern FormationRachid Guerraoui, Alexandre Maurer. [doi]
- Kleinberg's Grid ReloadedFabien Mathieu. [doi]
- Read-Write Memory and k-Set Consensus as an Affine TaskEli Gafni, Yuan He 0003, Petr Kuznetsov, Thibault Rieutord. [doi]
- The Case for Reconfiguration without Consensus: Comparing Algorithms for Atomic StorageLeander Jehl, Hein Meling. [doi]
- Time and Space Optimal Counting in Population ProtocolsJames Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier. [doi]
- How Lock-free Data Structures Perform in Dynamic Environments: Models and AnalysesAras Atalar, Paul Renaud-Goud, Philippas Tsigas. [doi]
- WNetKAT: A Weighted SDN Programming and Verification LanguageKim G. Larsen, Stefan Schmid, Bingtian Xue. [doi]
- Computationally Light "Multi-Speed" Atomic MemoryAntonio Fernández Anta, Theophanis Hadjistasi, Nicolas C. Nicolaou. [doi]
- Blockchain - From the Anarchy of Cryptocurrencies to the Enterprise (Keynote Abstract)Christian Cachin. [doi]
- Using Read-k Inequalities to Analyze a Distributed MIS AlgorithmSriram V. Pemmaraju, Talal Riaz. [doi]
- Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3Johanne Cohen, Khaled Maamra, George Manoussakis, Laurence Pilard. [doi]
- Relaxed Byzantine Vector ConsensusZhuolun Xiang, Nitin H. Vaidya. [doi]
- Step Optimal Implementations of Large Single-Writer RegistersTian Ze Chen, Yuanhao Wei. [doi]
- Exploring Key-Value Stores in Multi-Writer Byzantine-Resilient Register EmulationsTiago Oliveira, Ricardo Mendes, Alysson Neves Bessani. [doi]
- Generalized Selectors and Locally Thin Families with Applications to Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful TransmissionsAnnalisa De Bonis. [doi]
- Flexible Paxos: Quorum Intersection RevisitedHeidi Howard, Dahlia Malkhi, Alexander Spiegelman. [doi]
- Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract)Faith Ellen. [doi]
- k-Set Agreement in Communication Networks with Omission FaultsEmmanuel Godard, Eloi Perdereau. [doi]
- Moving Participants Turtle ConsensusStavros Nikolaou, Robbert van Renesse. [doi]
- Design Patterns in Beeping AlgorithmsArnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari. [doi]
- Set-Consensus Collections are DecidableCarole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov. [doi]
- m-Consensus Objects Are Pretty PowerfulAmmar Qadri. [doi]
- Front Matter, Table of Contents, Preface, Committees, List of Authors [doi]
- Deletion without Rebalancing in Non-Blocking Binary Search TreesMeng He, Mengdu Li. [doi]
- High Throughput Connectomics (Keynote Abstract)Nir Shavit. [doi]
- Predicate Detection for Parallel Computations with Locking ConstraintsYen-Jung Chang, Vijay K. Garg. [doi]
- RADON: Repairable Atomic Data Object in NetworksKishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard. [doi]
- Distributed Stable Matching with Similar Preference ListsPankaj Khanchandani, Roger Wattenhofer. [doi]
- Deterministic Population Protocols for Exact Majority and PluralityLeszek Gasieniec, David D. Hamilton, Russell Martin, Paul G. Spirakis, Grzegorz Stachowiak. [doi]
- Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial StepsStéphane Devismes, David Ilcinkas, Colette Johnen. [doi]
- Really Big Data: Analytics on Graphs with Trillions of Edges (Keynote Abstract)Willy Zwaenepoel. [doi]
- Bounded DisagreementDavid Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg. [doi]
- Deadline-Budget constrained Scheduling Algorithm for Scientific Workflows in a Cloud EnvironmentMozhgan Ghasemzadeh, Hamid Arabnejad, Jorge G. Barbosa. [doi]
- Dynamic Atomic SnapshotsAlexander Spiegelman, Idit Keidar. [doi]
- Proving Opacity of a Pessimistic STMSimon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, Heike Wehrheim. [doi]
- Non-Determinism in Byzantine Fault-Tolerant ReplicationChristian Cachin, Simon Schubert, Marko Vukolic. [doi]