Detailed Program

Downloadable version here.

Monday, October 09

09:00 – 12:20ADGA (EX-ISEF Building, Main Lecture Hall)
FRIDA (EX-ISEF Building, Room C)
WAND (EX-ISEF Building, Library)
(see workshops program)
12:20 – 14:00Lunch
14:00 – 18:00ADGA (EX-ISEF Building, Main Lecture Hall)
FRIDA (EX-ISEF Building, Room C)
WAND (EX-ISEF Building, Library)
(see workshops program)
18:00 – 20:00Welcome Reception (with food and drinks)

Tuesday, October 10 (Rectorate Building, Auditorium)

08:45 – 08:55           Welcome Address from Paola Inverardi (GSSI rectress)
08:55 – 09:55Keynote 1 (Dijkstra Award): Tal Rabin
09:55 – 10:15Coffee Break
Session 1: Byzantine fault tolerance
10:15 – 10:35Xiao Li, Eric Chan and Mohsen Lesani
On the power of quorum subsumption for heterogeneous quorum systems
10:35 – 10:55Erica Blum, Elette Boyle, Ran Cohen and Chen-Da Liu-Zhang
Communication Lower Bounds for Cryptographic Broadcast Protocols
10:55 – 11:15Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Matteo Monti and Manuel Vidigueira
Every Bit Counts in Consensus
11:15 – 11:20Shir Cohen and Idit Keidar
Subquadratic Multivalued Asynchronous Byzantine Agreement WHP
11:20 – 11:25Yuval Gelles and Ilan Komargodski
Scalable Agreement Protocols with Optimal Optimistic Efficiency
11:25 – 11:30Marc Leinweber and Hannes Hartenstein
Let It TEE: Asynchronous Byzantine Atomic Broadcast with n >= 2f+1
11:30 – 11:40Break
Session 2: Networks Algorithms I
11:40 – 12:00Giovanni Viglietta and Giuseppe Antonio Di Luna
Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks
12:00 – 12:20Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport and Ioan Todinca
Distributed Certification for Classes of Dense Graphs
12:20 – 14:00Lunch
Session 3: Blockchain
14:00 – 14:20Sarah Azouvi, Guy Goren, Lioba Heimbach and Alexander Hicks
Base Fee Manipulation In Ethereum’s EIP-1559 Transaction Fee Mechanism
14:20 – 14:40Youer Pu, Ali Farahbakhsh, Lorenzo Alvisi and Ittay Eyal
Gorilla: Safe Permissionless Byzantine Consensus
14:40 – 15:00Ittai Abraham, Danny Dolev, Ittay Eyal and Joseph Halpern
Colordag: An Incentive-Compatible Blockchain
15:00 – 15:20Idit Keidar, Oded Naor, Ouri Poupko and Ehud Shapiro
Cordial Miners: Fast and Efficient Consensus for Every Eventuality
15:20 – 15:25Giuliano Losa and Eli Gafni
Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority
15:25 – 15:30Ehud Shapiro
Grassroots Distributed Systems: Concept, Examples, Implementation and Applications
15:30 – 16:00Coffee Break
Session 4: Concurrency and Shared Memory I
16:00 – 16:20Davide Frey, Mathieu Gestin and Michel Raynal
The Synchronization Power (Consensus Number) of Access-Control Objects: The Case of AllowList and DenyList
16:20 – 16:40Anh Tran and Edward Talmage
Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues
16:40 – 17:00Naama Ben-David, Gal Sela and Adriana Szekeres
The FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems
17:00 – 17:05Jakeb Chouinard, Kush Kansara, Xialin Liu, Nihal Potdar and Wojciech Golab
On Implementing Wear Leveling in Persistent Synchronization Structures
17:05 – 17:10Vitaly Aksenov, Michael Anopenko, Alexander Fedorov and Michael Spear
BatchBoost: Universal Batching for Concurrent Data Structures
17:10 – 17:45Break
17:45 – 19:15Business Meeting
19:15 – 20:30Aperitif

Wednesday, October 11 (Rectorate Building, Auditorium)

09:00 – 10:00             Keynote 2: Amos Korman
10:00 – 10:25Coffee Break
Session 5: Network Algorithms II
10:25 – 10:45Bernadette Charron-Bost and Louis Penet de Monterno
Self-Stabilizing Clock Synchronization in Probabilistic Networks
10:45 – 11:05Peter Robinson
Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraph, Breadth-First Search Tree, and LCL Problems
11:05 – 11:25Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti and Gustav Schmid
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
11:25 – 11:40Break
Session 6: Security and Privacy
11:40 – 12:00Ananya Appan, Anirudh Chandramouli and Ashish Choudhury
Network Agnostic Perfectly Secure MPC Against General Adversaries
12:00 – 12:20Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafael Pinot and Sasha Voitovych
On the Inherent Anonymity of Gossiping
12:20 – 14:00Lunch
Session 7: Mobile and Biologically-Inspired Computing
14:00 – 14:20Evangelos Bampas, Joffroy Beauquier, Janna Burman and William Guy-Obé
Treasure hunt with volatile pheromones
14:20 – 14:40Avery Miller and Andrzej Pelc
Fast Deterministic Rendezvous in Labeled Lines
14:40 – 15:00Romain Cosson, Laurent Massoulié and Laurent Viennot
Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter
15:00 – 15:20Irina Kostitsyna, Tom Peters and Bettina Speckmann
Fast Reconfiguration for Programmable Matter
15:20 – 15:25Alfredo Navarra and Francesco Piselli
Linearization in Silent Programmable Matter
15:25 – 17:30Free/Research Time
17:30 – 19:30Social Event (Mandolin and Guitar Concert), at Auditorium del Parco
19:30 – 22:00Social Dinner (at “Lo Scalco dell’Aquila” restaurant)

Thursday, October 12 (Rectorate Building, Auditorium)

09:00 – 10:00Keynote 3: Lorenzo Alvisi
10:00 – 10:20Coffee Break
Session 8: Network Algorithms III
10:20 – 10:40Marc Fuchs and Fabian Kuhn
List Defective Colorings: Distributed Algorithms and Applications
10:40 – 11:00Maxime Flin, Magnus Halldorsson and Alexandre Nolin
Fast Coloring Despite Congested Relays
11:00 – 11:20Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai and Jara Uitto
Conditionally Optimal Parallel Coloring of Forests
11:20 – 11:25Sameep Dahal, Francesco d’Amore, Henrik Lievonen, Timothé Picavet and Jukka Suomela
Distributed derandomization revisited
11:25 – 11:35Break
Session 9: Miscellaneous Topics (formal methods + MPC)
11:35 – 11:55Karine Altisen, Stéphane Devismes and Pierre Corbineau
Certified Round Complexity of Self-Stabilizing Algorithms
11:55 – 12:15Mélanie Cambus, Fabian Kuhn, Shreyas Pai and Jara Uitto
Time and Space Optimal Massively Parallel Algorithm for the 2-ruling Set Problem
12:15 – 12:20Michael Chen, A. Pavan and N. V. Vinodchandran
Relations between Space-Bounded and Adaptive Massively Parallel Computations
12:20 – 14:00Lunch
Session 10: Asynchronous Computability and Knowledge
14:00 – 14:20Hagit Attiya, Pierre Fraigniaud, Ami Paz and Sergio Rajsbaum
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks
14:20 – 14:40Raïssa Nataf, Guy Goren and Yoram Moses
Null Messages, Information and Coordination
14:40 – 15:10 (joint talk)Emmanuel Godard and Yannis Coutouly
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement

Hagit Attiya, Armando Castañeda and Thomas Nowak
Topological Characterization of Task Solvability in General Models of Computation
15:10 – 15:30Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin and Michel Raynal
Send/Receive Patterns versus Read/Write Patterns
15:30 – 15:35Hagit Attiya and Jennifer Welch
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit
15:35 – 16:05Coffee Break
Session 11: Concurrency and Shared Memory II
16:05 – 16:25Sahil Dhoked, Wojciech Golab and Neeraj Mittal
Modular Recoverable Mutual Exclusion Under System-Wide Failures
16:25 – 16:45Gadi Taubenfeld
Memory-anonymous Starvation-free Mutual Exclusion: Possibility and Impossibility Results
16:45 – 17:05Prasad Jayanti, Siddhartha Jayanti and Sucharita Jayanti
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining
17:05 – 17:10Sean Ovens
The Space Complexity of Set Agreement Using Swap
17:10 – 17:15Tomer Lev Lehman, Hagit Attiya and Danny Hendler
Recoverable and Detectable Self-Implementations of Swap

Friday, October 13

09:00 – 12:20PODL (EX-ISEF Building, Main Lecture Hall)
HACDA (EX-ISEF Building, Room C)
AMG (EX-ISEF Building, Library)
(see workshops program)
12:20 – 14:00Lunch
14:00 – 17:30PODL (EX-ISEF Building, Main Lecture Hall)
HACDA (EX-ISEF Building, Room C)
AMG (EX-ISEF Building, Library)
(see workshops program)