Program

Monday, December 18
08:45-09:00
Opening
09:00-10:00
Keynote: What Should We Learn From Satoshi Nakamoto's Blockchain? (slides)
Roger Wattenhofer, ETH Zurich
Chair: James Aspnes
10:00-10:30
Coffee break
10:30-12:15
Session 1: Graph and Network Algorithms
Chair: José Pereira
1. Broadcasting in an Unreliable SINR model (slides)
Fabian Kuhn and Philipp Schneider
2. Fast Distributed Approximation for TAP and 2-Edge-Connectivity (slides)
Keren Censor-Hillel and Michal Dory
3. Distributed Distance-Bounded Network Design Through Distributed Convex Programming (slides)
Michael Dinitz and Yasamin Nazari
4. Lower Bounds for Subgraph Detection in the CONGEST Model (slides)
Tzlil Gonen and Rotem Oshman
12:15-14:00
Lunch break
14:00-15:45
Session 2: Concurrency
Chair: Miguel Pardal
1. Extending Transactional Memory with Atomic Deferral (slides)
Tingzhe Zhou, Victor Luchangco and Michael Spear
2. Progress-Space Tradeoffs in Single-Writer Memory Implementations (slides)
Damien Imbs, Petr Kuznetsov and Thibault Rieutord
3. The Teleportation Design Pattern for Hardware Transactional Memory (slides)
Nachshon Cohen, Maurice Herlihy, Erez Petrank and Elias Wald
4. Lock Oscillation: Boosting the Performance of Concurrent Data Structures (slides)
Nikolaos Kallimanis and Panagiota Fatourou
15:45-16:15
Coffee break
16:15-18:00
Session 3: Agents and Robots
Chair: Sebastien Tixeuil
1. Evacuating an Equilateral Triangle in the Face-to-Face Model
Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan and Jaroslav Opatrny
2. Model Checking of Robot Gathering (slides)
Thi Thu Ha Doan, François Bonnet and Kazuhiro Ogata
3. Plane formation by synchronous mobile robots without chirality (slides)
Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita
4. Treasure Hunt with Barely Communicating Agents (slides)
Stefan Dobrev, Rastislav Královič and Dana Pardubská
18:00-20:00
Reception

Tuesday, December 19
9:00-10:00
Keynote: Causality for the Masses: Offering Fresh Data, Low Latency, and High Throughput (slides)
Luis Rodrigues, INESC-ID/IST, U. Lisboa
Chair: Pascal Felber
10:00-10:30
Coffee break
10:30-12:15
Session 4: Shared Memory
Chair: Panagiota Fatourou
1. Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms (slides)
Bogdan Chlebus, Gianluca De Marco and Muhammed Talo
2. Lower Bounds on the Amortized Time Complexity of Shared Objects (slides)
Hagit Attiya and Arie Fouren
3. Mutual exclusion algorithms with constant RMR complexity and wait-free exit code (slides)
Rotem Dvir and Gadi Taubenfeld
4. Remote Memory References at Block Granularity (slides)
Hagit Attiya and Gili Yavneh
12:15-14:00
Lunch break
14:00-15:45
Session 5: Algorithms, Randomization and Optimization
Chair: Yukiko Yamauchi
1. Constant-space population protocols for uniform bipartition (slides)
Hiroto Yasumi, Fukuhito Ooshita, Ken'Ichi Yamaguchi and Michiko Inoue
2. Fast Detection of Stable and Counting Predicates in Parallel Computations (slides)
Himanshu Chauhan and Vijay Garg
3. Deterministic subgraph detection in broadcast CONGEST (slides)
Janne H. Korhonen and Joel Rybicki
4. Schlegel Diagram and Optimizable Immediate Snapshot Protocol (slides)
Susumu Nishimura
15:45-16:15
Coffee break
16:15-17:30
Session 6: Replication and Consensus
Chair: Miguel Correia
1. Designing a Planetary-Scale IMAP Service with Conflict-free Replicated Data Types (slides)
Tim Jungnickel, Lennart Oldenburg and Matthias Loibl
2. Non-uniform Replication (slides)
Gonçalo Cabrita and Nuno Preguiça
3. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus (slides)
Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren and Alexander Spiegelman
17:30-18:00
Business Meeting
20:00-22:00
Banquet, Restaurante Via Graça

Wednesday, December 20
9:00-10:15
Session 7: Security and Dependability
Chair: Luis Rodrigues
1. Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant Storage (slides)
Eduardo Alchieri, Alysson Bessani, Fabiola Greve and Joni da Silva Fraga
2. Hardening Cassandra Against Byzantine Failures (slides)
Roy Friedman and Roni Licher
3. Vulnerability-Tolerant Transport Layer Security (slides)
André Joaquim, Miguel Pardal and Miguel Correia
10:15-10:45
Coffee break
10:45-12:30
Session 8: Distributed Algorithms
Chair: Miguel Matos
1. Asynchronous Message Orderings Beyond Causality (slides)
Adam Shimi, Aurélie Hurault and Philippe Quéinnec
2. Constant Space and Non-Constant Time in Distributed Computing (slides)
Tuomo Lempiäinen and Jukka Suomela
3. Shape Formation by Programmable Particles (slides)
Giovanni Viglietta, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro and Yukiko Yamauchi
4. Synthesis of Distributed Algorithms with Parameterized Threshold Guards (slides)
Marijana Lazic, Igor Konnov, Josef Widder and Roderick Bloem
12:30-12:45
Closing