List of accepted papers
Synthesis of Distributed Algorithms with Parameterized Threshold Guards
Marijana Lazic, Igor Konnov, Josef Widder and Roderick Bloem.
Broadcasting in an Unreliable SINR model
Fabian Kuhn and Philipp Schneider.
Deterministic subgraph detection in broadcast CONGEST
Janne H. Korhonen and Joel Rybicki.
Model Checking of Robot Gathering
Thi Thu Ha Doan, François Bonnet and Kazuhiro Ogata.
Schlegel Diagram and Optimizable Immediate Snapshot Protocol
Susumu Nishimura.
Shape Formation by Programmable Particles
Giovanni Viglietta, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro and Yukiko Yamauchi.
Treasure Hunt with Barely Communicating Agents
Stefan Dobrev, Rastislav Královič and Dana Pardubská.
Asynchronous Message Orderings Beyond Causality
Adam Shimi, Aurélie Hurault and Philippe Quéinnec.
The Teleportation Design Pattern for Hardware Transactional Memory
Nachshon Cohen, Maurice Herlihy, Erez Petrank and Elias Wald.
Distributed Distance-Bounded Network Design Through Distributed Convex Programming
Michael Dinitz and Yasamin Nazari.
Plane formation by synchronous mobile robots without chirality
Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita.
Solida: A Cryptocurrency Based on Reconfigurable Byzantine Consensus
Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren and Alexander Spiegelman.
The Amortized Time Complexity of Shared Objects
Hagit Attiya and Arie Fouren.
Remote Memory References at Block Granularity
Hagit Attiya and Gili Yavneh.
Mutual exclusion algorithms with constant RMR complexity and wait-free exit code
Rotem Dvir and Gadi Taubenfeld.
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
Keren Censor-Hillel and Michal Dory.
Vulnerability-Tolerant Transport Layer Security
André Joaquim, Miguel Pardal and Miguel Correia.
Designing a Planetary-Scale IMAP Service with Conflict-free Replicated Data Types
Tim Jungnickel, Lennart Oldenburg and Matthias Loibl.
Lower Bounds for Subgraph Detection in the CONGEST Model
Tzlil Gonen and Rotem Oshman.
Lock Oscillation: Boosting the Performance of Concurrent Data Structures
Nikolaos Kallimanis and Panagiota Fatourou.
Progress-Space Tradeoffs in Single-Writer Memory Implementations
Damien Imbs, Petr Kuznetsov and Thibault Rieutord.
Constant Space and Non-Constant Time in Distributed Computing
Tuomo Lempiäinen and Jukka Suomela.
Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms
Bogdan Chlebus, Gianluca De Marco and Muhammed Talo.
Evacuating an Equilateral Triangle in the Face-to-Face Model
Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan and Jaroslav Opatrny.
Fast Detection of Stable and Counting Predicates in Parallel Computations
Himanshu Chauhan and Vijay Garg.
Non-uniform Replication
Gonçalo Cabrita and Nuno Preguiça.
Constant-space population protocols for uniform bipartition
Hiroto Yasumi, Fukuhito Ooshita, Ken'Ichi Yamaguchi and Michiko Inoue.
Extending Transactional Memory with Atomic Deferral
Tingzhe Zhou, Victor Luchangco and Michael Spear.
Hardening Cassandra Against Byzantine Failures
Roy Friedman and Roni Licher.
Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant Storage
Eduardo Alchieri, Alysson Bessani, Fabiola Greve and Joni Da Silva Fraga.