Keynote: Dahlia Malkhi University of California, Santa Barbara
Coffee break
Session 1 — Reliable Communication in Distributed Systems
What Information Survives Authenticated Byzantine Communication?
Arnab Mallick (Centre For Development of Advanced Computing), Indraveni Chebolu (Centre For Development of Advanced Computing)
From MBRB back to BRB: Achieving Byzantine Reliable Broadcast in Asynchronous Message-Lossy Systems by Constraining the Message Adversary
Zakaria El Maachi (College of Computing, University Mohammed VI Polytechnic), Davide Frey (Univ Rennes, Inria, CNRS, IRISA), Michel Raynal (Univ Rennes, Inria, CNRS, IRISA), François Taïani (Univ Rennes, Inria, CNRS, IRISA)
Byzantine Reliable Broadcast with Causal Ordering
Mariarosaria Barbaraci (University of Bern), Christian Cachin (University of Bern)
Distributed Non-Interactive Zero-Knowledge Proofs
Alex B. Grilo (Sorbonne Université, CNRS, LIP6), Ami Paz (Université Paris-Saclay, CNRS, LISN), Mor Perry (The Academic College of Tel-Aviv-Yaffo)
Which ♢P Algorithm is Suitable for You? An Empirical Benchmark on Real Network Traces
Yenan Wang (Chalmers University of Technology), Elad Michael Schiller (Chalmers University of Technology), Carla Fabiana Chiasserini (Chalmers University of Technology, Politecnico di Torino), Jens Kollberg (Chalmers University of Technology)
Lunch
Session 2 — Byzantine Fault Tolerance & Agreement
Decoupling Faults from Uncertainty: Message-Efficient Byzantine Agreement with Local Predictions
Michael Yiqing Hu (National University of Singapore), Leander Jehl (University of Stavanger), Paul Franke-Bergmann (Friedrich-Alexander-Universität Erlangen-Nürnberg), Jialin Li (National University of Singapore), Christian Berger (Friedrich-Alexander-Universität Erlangen-Nürnberg)
Coffee break
Session 3 — Shared Memory & Concurrent Objects
Read-Modify-Writable Snapshots with Optimal Invisible Reads from Read/Write Operations
Armando Castaneda (UNAM), Braulio Ramses Hernández Martínez (UNAM)
Removing bounds on the number of uses can increase an object’s consensus number
Warren Zhu (University of Toronto)
Making History-Independence-Preserving LL/SC Writable
Dante Bencivenga (University of Calgary), Philipp Woelfel (University of Calgary)
Business meeting
Transfer to the city center
Transfer to IMDEA
Keynote: Martin Kleppmann University of Cambridge
Coffee break
Session 4 — Synchronization & Distributed Systems
ChimeRA: High-performance and Fault-Tolerant RDMA Atomic Array
Amanda Baran (Lehigh University), Jacob Nelson (Lehigh University), Lewis Tseng (UMass Lowell), Roberto Palmieri (Lehigh University)
Deadline-Aware Scheduling of Multiple Workflows under Edge Heterogeneous Computing Constraints
An $O(\diam)$-Round Snap-stabilizing Termination Detection in Arbitrary Rooted Networks
Karine Altisen (University of Geneva), Alain Cournier (University of Picardie), Geoffrey Defalque (University of Picardie), Stéphane Devismes (University of Picardie)
Lunch
Session 5 — Distributed Graph Algorithms
A Simple Construction of Locally Checkable Problems Filling the LOCAL Complexity Gaps in Graphs with Arbitrary Large Degrees
Filippo Casagrande (Gran Sasso Science Institue), Pierre Fraigniaud (CNRS and Université Paris Cité), Benjamin Jauregui (Universidad de Chile, CNRS and Université Paris Cité), Mikaël Rabie (CNRS and Université Paris Cité)
Greedy-Like Defective Coloring: Distributed Algorithms and Applications
Marc Fuchs (University of Freiburg), Fabian Kuhn (University of Freiburg)
Faster CONGEST Approximation Algorithms for Maximum Weight Independent Set in Sparse Graphs
Salwa Faour (University of Freiburg), Fabian Kuhn (University of Freiburg)
A space and time optimal population protocol for $O(\Delta)$-colouring graphs
Joel Rybicki (Humboldt-Universität zu Berlin), Jakob Solnerzik (Humboldt-Universität zu Berlin)
Coffee break
Session 6 — Consensus & Approximate Agreement
Optimal Signature-Free Consensus Made Simple
Antonio J. Fernández-Pinto (IMDEA Software Institute), Manuel Bravo (Informal Systems), Gregory Chockler (University of Surrey), Alexey Gotsman (IMDEA Software Institute)
Optimal Random Coins for Ben-Or Like Consensus Algorithms
Faster Convergence of Multidimensional Approximate Agreement via Smallest Enclosing Balls
Darya Melnyk (TU Berlin)
Randomized Consensus in $O(n \log\log n)$ Expected Steps Using Single-Writer Registers
Hagit Attiya (Technion), Yoav Ben Shimon (Tel-Aviv University)
Relativistic Linearizability with Majority Quorums
Wojciech Golab (University of Waterloo), Wojciech Wawrzyniak (Adam Mickiewicz University)
Transfer to the city center
Banquet
Transfer to IMDEA
Keynote: Rotem Oshman Tel-Aviv University
Coffee break
Session 7 — Distributed and Parallel Computing Models and Algorithms
Introducing the Self-Stabilizing SLEEPING Model
Mikaël Rabie (Université Paris Cité, IRIF, CNRS), Colette Johnen (LaBRI, CNRS), Tistou Fages (LIP, CNRS, ENS de Lyon)
Simulations between Massively Parallel Computing and Distributed Computing
Philipp Schneider (CISPA Helmholtz Center for Information Security), Julian Werthmann (Universität Paderborn)
Improved (Minimum) Spanning Tree Construction in the HYBRID Model
Shoma Hiraoka (The University of Osaka), Naoki Kitamura (The University of Osaka), Taisuke Izumi (The University of Osaka)
A Massively Parallel Algorithm for Maximal Independent Set on Hypergraphs
Srikkanth Ramachandran (University of California Davis), Helia Yazdanyar (University of Waterloo)
BlockNetLat: From Global Server Measurements to Geographically-Informed Peer-to-Peer Blockchain Latency Datasets
Evangelos Kolyvas (Athens University of Economics and Business), Alexandros Antonov (Athens University of Economics and Business), Spyros Voulgaris (Athens University of Economics and Business)
Lunch
Session 8 — Mobile Agents and Distributed Tracking
Exploring real infinite plane with obstacles by an agent with pebbles.
Stefan Dobrev (Slovak Academy of Sciences), Rastislav Královič (Comenius University in Bratislava), Dana Pardubská (Comenius University in Bratislava)
Rendezvous under Variable Disorientation: The Algorithmic Power of Fixed Unit Distance
Safe Exploration of Arbitrary Dynamic Dangerous Networks
Caterina Feletti (Carleton University; University of Ottawa), Paola Flocchini (University of Ottawa), Giuseppe Prencipe (University of Pisa), Nicola Santoro (Carleton University)
Memory Equivalence Between Directed Local Failover Routing and Mobile-Agent Perpetual Exploration
Naoki Kitamura (The University of Osaka), Kaito Harada (The University of Osaka), Yuki Kawashima (The University of Osaka), Yuya Terashima (The University of Osaka)
The Maximum Distributed Online Tracking Problem
Yixing Zhang (Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg), Romaric Duvignau (Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg)