Monday 9th October 2023

ADGA: Workshop on Advances in Distributed Graph Algorithms

Chair: Laurent Feuilloley

• 09.00 – 10.00: Fabian Kuhn, TBA
• 10.00 – 11.00: Alexandre Nolin, Pseudorandomness: some distributed applications
• 11.00 – 11.20: Coffee Break
• 11.20 – 12.20: Joel Rybicki, TBA
• 12.20 – 14.00: Lunch
• 14.00 – 15.00: Eva Rotenberg, How to Colour a Changing Sparse Graph
• 15.00 – 16.00: Ami Paz, Beyond Worst-Case Analysis of Dynamic Networks
• 16.00 – 16.30: Coffee Break
• 16.30 – 17.30: Jara Uitto, Symmetry Breaking in Massive Graphs

FRIDA: The 10th Workshop on Formal Reasoning in Distributed Algorithms

Chairs: Stephan Merz, Marijana Lazic

• 09:00 – 9:45: Hagit Attiya, Faithful Simulation of Randomized BFT Protocols on Block DAGs
• 09:45 – 10:30: Gadi Taubenfeld, Reaching Consensus in Weak Models
• 10:30 – 10:50: Coffee Break
• 10:50 – 11:35: Alexey Gotsman, Synchronizer – a recipe for building correct algorithms under partial synchrony
• 11:35 – 12:20: Karine Altisen, PADEC – Interactive Proof for Self-Stabilizing Algorithms
• 12:20 – 14:00: Lunch Break
• 14:00 – 14:45: Manuel Bravo, Formal modeling at Informal Systems
• 14:45 – 15:30: Rotem Oshman, Distributed Certification
• 15:30 – 16:00: Coffee Break
• 16:00 – 16:30: Louis Penet de Monterno, Formal Verification of a Firing Algorithm
• 16:30 – 17:15: Ali Ebnenasir, Topology and Property-Specific Verification and Synthesis of Parameterized Distributed Protocols
• 17:15 – 18:00: Pierre Fraigniaud, TBA

WAND: Workshop on Analysis of Network Dynamics

Chairs: Isabella Ziccardi, Emilio Cruciani, Francesco d’Amore

• 09:30 – 10:15: Stefano Leucci
• 10:15 – 10:45: Coffee Break
• 10:45 – 11:30: Dimitrios Los
• 11:30 – 12.15: Robert Elsässer
• 12:15 – 14:00: Lunch
• 14:00 – 14:45: Luca Becchetti
• 14:45 – 15:30: Frederik Mallmann-Trenn
• 15:30 – 16:00: Coffee Break
• 16:00 – 16:45: Robin Vacus

Friday 13th October 2023

AMG: Algorithms for Massive Graphs

Chair: Jara Uitto

• 10:00 – 11:00: Gopinath Mishra, On Coloring problems in MPC and Congested Clique
• 11:00 – 11:20: Coffee Break
• 11:20 – 12:20: Peter Robinson, Distributed Graph Algorithms in the Vertex-Partition Model
• 12:20 – 14:00: Lunch
• 14:00 – 15:00: Talya Eden, Sampling an Edge in Sublinear Time Exactly and Optimally
• 15:00 – 16:00: Jukka Suomela, Low-degree graphs, sparse matrices, and low-bandwidth networks
• 16.00 – 16.30: Coffee Break

HACDA: Highlights of Asynchronous Concurrent and Distributed Algorithms

Chair: Naama Ben-David

• 09:00 – 10:00: Hagit Attiya
• 10:00 – 11:00: Siddhartha Jayanti
• 11:00 – 11:30: Coffee Break
• 11:30 – 12:30: Michal Friedman
• 12:30 – 14:00: Lunch
• 14:00 – 15:00: Pierre Civit
• 15:00 – 16:00: Rati Gelashvili
• 16:00 – 16:30: Coffee Break
• 16:30 – 17:00: Discussion Time and Closing Remarks

PODL: Workshop on Principles of Distributed Learning & Tutorial on Distributed Machine Learning

Chairs: Nirupam Gupta, Rafael Pinot, Rachid Guerraoui

• 09:00 – 09:10: Opening remarks
• 09:10 – 10.30: Rafael Pinot, Tutorial Part – I: Introduction to Robust Machine-Learning
• 10:30 – 11:00: Coffee Break
• 11.00 – 12.20: Nirupam Gupta, Tutorial Part – II: Robust ML with Privacy Constraints
• 12.20 – 14.00: Lunch
• 14.00 – 14.30: Noa Schiller, Distributed SGD in the Presence of System Partitions
• 14.30 – 15.00: Marco Canini, Why Federated Learning isn’t like PAPER?
• 15.00 – 15.30: Ce Zhang, Optimizing Communications and Data for Distributed and Decentralized Learning
• 15.30 – 16.00: Coffee Break
• 16.00 – 16.30: Lili Su, A Non-parametric View of FedAvg and FedProx: Beyond Stationary Points
• 16.30 – 17.00: Alberto Pedrouzo Ulloa, Practical Multi-Key Homomorphic Encryption for Federated Average Aggregation
• 17.00 – 17.30: Closing remarks