Program | Conference Template

Program at a glance

Sunday, May 26

19:00 - 21:30: Reception

Monday, May 27

09:00 - 12:30: Morning sessions
12:30 - 14:30: Lunch break
14:30 - 17:30: Afternoon sessions
17:45 - 19:00: Business meeting

Tuesday, May 28

09:00 - 12:30: Morning sessions
12:30 - 14:30: Lunch break
15:30 - 18:30: Excursion
20:00 - 21:30: Banquet

Wednesday, May 29

09:00 - 12:30: Morning sessions
12:30 - 14:30: Lunch break
14:30 - 17:30: Afternoon sessions

Detailed program

With the exception of the excursion, all conference events will take place at the Lloyd's Baia Hotel in Vietri, Salerno. Specifically, talks will be held in Sala E, the welcome reception and coffee breaks on the Terrazza panoramica, and lunches in the hotel restaurant.

Sunday, May 26

19:00 - 21:30 Reception

Monday, May 27

09:00 - 09:10 Opening remarks

09:10 - 10:10 Keynote 1

Giovanni Viglietta: History Trees and Their Applications

10:10 - 10:30 Coffee and snacks

10:30 - 11:30 Session 1

10:30 - 10:50 Computing Replacement Paths in the CONGEST Model. Vignesh Manoharan and Vijaya Ramachandran
10:50 - 11:10 On Distributed Computation of the Minimum Triangle Edge Transversal. Majd Khoury and Keren Censor-Hillel
11:10 - 11:30 Distributed Fractional Local Ratio and IS Approximation. Magnús M. Halldórsson and Dror Rawitz

11:30 - 11:50 Coffee and snacks

11:50 - 12:30 Session 2

11:50 - 12:10 Universal Coating by 3D Programmable Matter. Irina Kostitsyna, David Liedtke and Christian Scheideler
12:10 - 12:30 Deterministic Leader Election for Stationary Programmable Matter in the Presence of Obstacles. Jérémie Chalopin, Shantanu Das and Maria Kokkou

12:30 - 14:30 Lunch

14:30 - 15:30 Keynote 2

Fabian Kuhn: Distributed Coloring Algorithms Based on List Defective Colorings

15:30 - 15:50 Coffee and snacks

15:50 - 16:30 Session 3

15:50 - 16:10 An Analysis of Avalanche Consensus. Philipp Schneider, Christian Chachin and Ignacio Amores Sesar
16:10 - 16:20 Brief Announcement: Sharding in permissionless systems in presence of an adaptive adversary. Emmanuelle Anceaume, Davide Frey and Arthur Rauch
16:20 - 16:30 Brief Announcement: Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems. Hugo Rincon Galeana and Ulrich Schmid

16:30 - 16:50 Coffee and snacks

16:50 - 17:30 Session 4

16:50 - 17:10 Awake Complexity of Distributed Minimum Spanning Tree. John Augustine, William K. Moses Jr. and Gopal Pandurangan
17:10 - 17:30 Towards singular optimality in the presence of local initial knowledge. Hongyan Ji and Sriram Pemmaraju

17:45 - 19:00 Business meeting

Tuesday, May 28

09:00 - 10:00 Session 5

09:00 - 09:20 Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens. Keren Censor-Hillel, Yuka Machino and Pedro Soto (best student paper)
09:20 - 09:40 \(k\)-Center Clustering in Distributed Models. Leyla Biabiani and Ami Paz
09:40 - 10:00 Locally Balanced Allocations under Strong Byzantine Influence. Paweł Garncarek, Costas Busch and Dariusz Kowalski

10:00 - 10:20: Coffee and snacks

10:20 - 11:20: Session 6

10:20 - 10:40 Non-Negotiating Distributed Computing. Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Pierre Fraigniaud and Corentin Travers
10:40 - 11:00 Reaching Agreement Among \(k\) out of \(n\) Processes. Gadi Taubenfeld
11:00 - 11:20 Better Sooner Rather Than Later. Anaïs Durand, Michel Raynal and Gadi Taubenfeld

11:20 - 11:40 Coffee and snacks

11:40 - 12:30 Session 7

11:40 - 12:00 Stability of P2P Networks Under Greedy Peering. Lucianna Kiffer and Rajmohan Rajaraman (best paper)
12:00 - 12:20 All You Need are Random Walks: Fast and Simple Distributed Conductance Testing. Tugkan Batu, Amitabh Trehan and Chhaya Trehan
12:20 - 12:30 Brief Announcement: On the existence of consensus converging organized groups in large social networks. Yannis Stamatiou, Vasiliki Liagkou, Panagiotis Nastou and Paul Spirakis

12:30 - 14:30 Lunch

15:30 - 18:30 Excursion

20:00 - 21:30 Banquet

Wednesday, May 29

09:00 - 10:00 Keynote 3

Shiri Chechik: Approximate Shortest Paths and Distance Oracles

10:00 - 10:20 Coffee and snacks

10:20 - 11:20 Session 8

10:20 - 10:40 Highly-Efficient Persistent FIFO Queues. Panagiota Fatourou, Nikos Giachoudis and George Mallis
10:40 - 11:00 On the Bit Complexity of Iterated Memory. Guillermo Toyos-Marfurt and Petr Kuznetsov
11:00 - 11:20 Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. Colette Johnen, Adnane Khattabi, Alessia Milani and Jennifer Welch

11:20 - 11:40 Coffee and snacks

11:40 - 12:30 Session 9

11:40 - 12:00 Distributed Binary Labeling Problems in High-Degree Graphs. Henrik Lievonen, Timothé Picavet and Jukka Suomela
12:00 - 12:20 Optimal Memory Requirement for Self-Stabilizing Token Circulation. Lelia Blin, Gabriel Le Bouder and Franck Petit
12:20 - 12:30 Brief Announcement: Online Drone Scheduling for Last-mile Delivery. Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas and Partha Sarathi Mandal

12:30 - 14:30 Lunch

14:30 - 15:30 SIROCCO Prize talk

Shay Kutten

15:30 - 15:50 Coffee and snacks

15:50 - 16:30 Session 10

15:50 - 16:10 Stand-Up Indulgent Gathering on Rings. Quentin Bramas, Sayaka Kamei, Anissa Lamani and Sebastien Tixeuil
16:10 - 16:20 Brief Announcement: Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs. Erik van den Akker, Kevin Buchin and Klaus-Tycho Foerster
16:20 - 16:30 Brief Announcement: Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. Keita Nakajima, Kaito Takase and Koichi Wada

16:30 - 16:50 Coffee and snacks

16:50 - 17:30 Session 11

16:50 - 17:10 Mutual visibility in hypercube-like graphs. Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra and Francesco Piselli
17:10 - 17:30 In Search of the Lost Tree: Hardness and relaxation of spanning trees in temporal graphs. Arnaud Casteigts and Timothée Corsin