Abstract is missing.
- Constant Space and Non-Constant Time in Distributed ComputingTuomo Lempiäinen, Jukka Suomela. [doi]
- Distributed Distance-Bounded Network Design Through Distributed Convex ProgrammingMichael Dinitz, Yasamin Nazari. [doi]
- Plane Formation by Synchronous Mobile Robots without ChiralityYusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita. [doi]
- Extending Transactional Memory with Atomic DeferralTingzhe Zhou, Victor Luchangco, Michael F. Spear. [doi]
- Constant-Space Population Protocols for Uniform BipartitionHiroto Yasumi, Fukuhito Ooshita, Ken-ichi Yamaguchi, Michiko Inoue. [doi]
- piChain: When a Blockchain meets PaxosConrad Burchert, Roger Wattenhofer. [doi]
- Synthesis of Distributed Algorithms with Parameterized Threshold GuardsMarijana Lazic, Igor Konnov 0001, Josef Widder, Roderick Bloem. [doi]
- Treasure Hunt with Barely Communicating AgentsStefan Dobrev, Rastislav Královic, Dana Pardubská. [doi]
- Lock Oscillation: Boosting the Performance of Concurrent Data StructuresPanagiota Fatourou, Nikolaos D. Kallimanis. [doi]
- Fast Distributed Approximation for TAP and 2-Edge-ConnectivityKeren Censor Hillel, Michal Dory. [doi]
- Vulnerability-Tolerant Transport Layer SecurityAndré Joaquim, Miguel L. Pardal, Miguel Correia 0001. [doi]
- Designing a Planetary-Scale IMAP Service with Conflict-free Replicated Data TypesTim Jungnickel, Lennart Oldenburg, Matthias Loibl. [doi]
- Anonymous Processors with Synchronous Shared Memory: Monte Carlo AlgorithmsBogdan S. Chlebus, Gianluca De Marco, Muhammed Talo. [doi]
- Progress-Space Tradeoffs in Single-Writer Memory ImplementationsDamien Imbs, Petr Kuznetsov, Thibault Rieutord. [doi]
- Lower Bounds on the Amortized Time Complexity of Shared ObjectsHagit Attiya, Arie Fouren. [doi]
- Schlegel Diagram and Optimizable Immediate Snapshot ProtocolSusumu Nishimura. [doi]
- Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit CodeRotem Dvir, Gadi Taubenfeld. [doi]
- Hardening Cassandra Against Byzantine FailuresRoy Friedman, Roni Licher. [doi]
- Remote Memory References at Block GranularityHagit Attiya, Gili Yavneh. [doi]
- Solida: A Blockchain Protocol Based on Reconfigurable Byzantine ConsensusIttai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren 0001, Alexander Spiegelman. [doi]
- Evacuating an Equilateral Triangle in the Face-to-Face ModelHuda Chuangpishit, Saeed Mehrabi 0001, Lata Narayanan, Jaroslav Opatrny. [doi]
- Asynchronous Message Orderings Beyond CausalityAdam Shimi, Aurélie Hurault, Philippe Quéinnec. [doi]
- Deterministic Subgraph Detection in Broadcast CONGESTJanne H. Korhonen, Joel Rybicki. [doi]
- Lower Bounds for Subgraph Detection in the CONGEST ModelTzlil Gonen, Rotem Oshman. [doi]
- Model Checking of Robot GatheringHa Thi Thu Doan, François Bonnet 0001, Kazuhiro Ogata 0002. [doi]
- Broadcasting in an Unreliable SINR ModelFabian Kuhn, Philipp Schneider. [doi]
- Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant StorageEduardo Alchieri, Alysson Bessani, Fabíola Greve, Joni da Silva Fraga. [doi]
- The Teleportation Design Pattern for Hardware Transactional MemoryNachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Fast Detection of Stable and Count Predicates in Parallel ComputationsHimanshu Chauhan, Vijay K. Garg. [doi]
- Shape Formation by Programmable ParticlesGiuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi. [doi]
- Causality for the Masses: Offering Fresh Data, Low Latency, and High ThroughputLuís Rodrigues. [doi]
- Non-Uniform ReplicationGonçalo Cabrita, Nuno M. Preguiça. [doi]