Detailed Program

All talks take place in the Aula del Chiostro unless stated otherwise. Brief announcements are marked BA. The program is preliminary and may still change.

Monday, 9 November — Workshops

Chiostro di San Pietro in Vincoli, Sapienza Università di Roma

08:15–09:00 Registration
09:00–11:00 Workshops
11:00–11:25 Coffee break
11:25–12:30 Workshops
12:30–13:45 Lunch
13:45–15:40 Workshops
15:40–16:00 Coffee break
16:00–18:00 Workshops
18:00–19:30 Welcome reception

including DISC over 40 years: some statistics and fun facts
by Alkida Balliu (GSSI, Italy)

Tuesday, 10 November — Conference

Aula del Chiostro

08:15–08:45 Registration
08:45–10:00 Session 1 — Communication efficient Byzantine agreement
Chair: TBD

  • Strong Efficiency Lower Bounds for Byzantine Agreement
    Matthieu Rambaud, Clément Ducros, Julian Loss
  • Predictions Can Only Help! Communication Efficient Byzantine Agreement with Predictions
    Marc Dufay, Muhammad Ayaz Dzulfikar, Seth Gilbert
  • Multivalued Consensus: General Adversaries Require More Communication
    Mose Mizrahi, Roger Wattenhofer
  • General Convex Agreement with Near-Optimal Communication
    Marc Dufay, Diana Ghinea, Anton Paramonov
10:00–11:00 Keynote 1 – David Peleg (Weizmann Inst., Israel)
Forty Years of Distributed Network Algorithms: A Portrait of DISC’s Scientific Harvest
11:00–11:25 Coffee break
11:25–12:30 Session 2 — Coloring and related problems
Chair: TBD

  • Deterministic Edge Coloring with few Colors in CONGEST
    Tijn de Vos, Yannic Maus, Joakim Blikstad
  • A Fast Deterministic Algorithm for (Δ+1)-Edge Coloring in CONGEST
    Sebastian Brandt, Ananth Narayanan, Alexandre Nolin
  • Triangle-Free Coloring in LOCAL via Resilient Lovász Local Lemma
    Peter Davies-Peck, Xusheng Zhang
  • Fast Deterministic Distributed Degree Splitting
    Yannic Maus, Alexandre Nolin, Florian Schager
12:30–13:45 Lunch break
13:45–15:40 Session 3 — Weak communication models
Chair: TBD

  • Randomized Tree-Intersection Leader Election
    Yuval Emek, Shay Kutten, Ido Rafael, Gadi Taubenfeld
  • Adaptive Self-Organization in Anonymous Dynamic Networks
    Garrett Parzych, Joshua Daymude
  • Fast and Robust Information Spreading in the Noisy PULL Model
    Niccolò D’Archivio, Amos Korman, Robin Vacus, Emanuele Natale
  • Weighted Beeping Networks
    Dariusz Kowalski, Miguel A. Mosteiro

— 5 min break —

  • Dynamic Graph Exploration: Semi-synchrony and Dynamic Port Labeling
    Ashish Saxena, Anisur Rahaman Molla, Kaushik Mondal, Gokarna Sharma
  • Self-Stabilizing Algorithms in the Uniform Port Model
    Yuval Emek, Liam Brinker, Oren Louidor
  • BA · Simple and Fast Self-Stabilizing Dynamics for k-Winner-Take-All Computation
    Vincenzo Bonifaci, Fabio Galvan
  • BA · Initialization with Exponentially Fewer Bits
    Dominick Banasik, Varsha Dani, Thomas P. Hayes
15:40–16:00 Coffee break
16:00–17:45 Session 4 — Best papers, topological arguments, computational settings
Chair: TBDBest papers

  • Best Paper · Non-Leaking Concurrent Objects
    Hagit Attiya, Rotem Oshman, Noa Schiller, Corentin Travers
  • Best Student Paper · Solvability of Approximate Agreement on Graphs and Simplicial Complexes
    Joel Rybicki, Yaroslav Verbitsky

— 5 min break —

Topological arguments

  • Consensus with Stochastic Broadcast
    Pierre Fraigniaud, Boaz Patt-Shamir, Sergio Rajsbaum
  • BA · Stone Duality Proofs for Colorless Distributed Computability Theorems
    Cameron Calk, Emmanuel Godard

Computational settings

  • Token Distribution Revisited
    Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Hamed Hosseinpour, Dominik Kaaser
  • Near-Tight Bounds on the Rate of Collective Communication
    Rotem Oshman, Tal Roth, Ofer Shayevitz, Anirudh Sivaraman
18:00–19:30 Business meeting

Wednesday, 11 November — Conference

Aula del Chiostro

08:45–10:00 Session 5 — Energy complexity and massively parallel computation
Chair: TBD

  • Tight Energy Lower Bounds for Distributed Graph Algorithms
    Fabien Dufoulon, Gopal Pandurangan, Peter Robinson
  • Approximating Minimum Dominating Set with Few Awake Rounds
    Hongyan Ji, Shreyas Pai, Sriram Pemmaraju
  • Fixed-Threshold Peeling in Sublinear MPC: Round-Approximation Tradeoffs and Applications
    Slobodan Mitrović, Theodore Pan, Wen-Horng Sheu
  • How to Walk a Dog in Parallel: on Parallel Computation of the Discrete Fréchet Distance
    Leonid Barenboim, Arnold Filtser, Omrit Filtser, Orr Fischer
  • BA · Simulations between Massively Parallel Computing and Distributed Computing
    Philipp Schneider, Julian Werthmann
10:00–11:00 Keynote 2 — Jennifer Welch (Texas A&M University)
Forty Years of Fault-Tolerant Distributed Computing: A Landscape Rooted in DISC
11:00–11:25 Coffee break
11:25–12:30 Session 6 — Population protocols
Chair: TBD

  • Consensus Time in 3-Majority and 2-Choices Is Determined by the Maximum Initial Opinion Density
    Niccolò D’Archivio
  • Efficient Stable Population Protocols for Parity and Beyond
    Leszek Gąsieniec, Tytus Grodzicki, Tomasz Jurdziński, Jakub Kowalski, Grzegorz Stachowiak
  • Near-optimal population protocols on bounded-degree trees
    Joel Rybicki, Jakob Solnerzik, Robin Vacus
  • Counting in Population Protocols on Graphs
    Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Thorsten Götte, Lukas Hintze, Dominik Kaaser
12:30–13:45 Lunch break
13:45–15:40 Session 7 — Efficient concurrent data structures
Chair: TBD

  • A Lock-Free Move-to-Front List with a Working Set Bound
    Shalom Asbell, Eric Ruppert
  • Space-Efficient Lock-Free Linear-Probing Hash Table
    Hagit Attiya, Rotem Oshman, Noa Schiller
  • Upper and Lower Bounds on the Space Complexity of Multi-word Single-Writer Registers
    Yuanhao Wei, Yousof Yavari
  • Efficient Randomized LL/SC that Preserves History Independence
    Dante Bencivenga, Homa Habashi, Philipp Woelfel

— 5 min break —

Correctness conditions of concurrent data structures

  • Adaptive Snapshots Require Visible Reads
    Niv Sulimany, Tomer Cory, Erez Petrank
  • Wait-free Replicated Data Types and Fair Reconciliation
    Petr Kuznetsov, Maxence Perion, Sara Tucci-Piergiovanni
  • BA · How Complex Can Sequential Consistency Be?
    Dimitar Dimitrov
  • BA · Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph
    Denis Korotchenko, Vitaly Aksenov
15:40–16:00 Coffee break
16:00–17:45 Session 8 — Solvability of agreement
Chair: TBD

  • Lifeline: Optimal Validated Byzantine Agreement under Minimal Synchrony
    Yuval Efron, Ling Ren
  • Symmetry all the way down
    Ignacio Amores-Sesar, Christian Cachin, Simon Holmgaard Kamp, Juan Villacis
  • Validity in Responsive Byzantine Agreement
    Diana Ghinea, Simon Holmgaard Kamp, Chen-Da Liu-Zhang
  • Fairness in the Wild: Secure Atomic Swap with External Incentives
    Hao Chung, Elisaweta Masserova, Elaine Shi, Sri AravindaKrishnan Thyagarajan
  • BA · Fair Binding for Hidden-State Authorization in Byzantine SMR
    Arnab Mallick
19:00–22:00 Conference banquet

including DISC: From conceivement to puberty
by Nicola Santoro (Carleton University, Canada)

Thursday, 12 November — Conference

Aula del Chiostro

08:45–10:00 Session 9 — Computing on graph families
Chair: TBD

  • Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity
    Malte Baumecker, Rustam Latypov, Yannic Maus, Jara Uitto
  • Õptimal Distributed Maximum Flow Approximation in Undirected Planar Graphs
    Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
  • Distributed Triangle and Simplex Enumeration in Hypergraphs
    Duncan Adamson, Will Rosenbaum, Paul Spirakis
  • What can be computed in average anonymous networks?
    Joel Rybicki, Oleg Verbitsky, Maksim Zhukovskii
10:00–11:00 Keynote 3 – Panel
Past and Future Impact of Distributed Computing
Rachid Guerraoui (EPFL, Switzerland), Maurice Herlihy (Brown University, USA), Idit Keidar (Technion, Israel), Andrea Richa (Arizona State University) and Jukka Suomela (Aalto University, Finland)
11:00–11:25 Coffee break
11:25–12:30 Session 10 — Cryptographic tools for fault tolerance
Chair: TBD

  • Fully Fluctuating Sleepy Consensus from Minimal Assumptions
    Javier Nieto, Yuval Efron, Joachim Neu, Ling Ren
  • Quadratic Asynchronous DKG from Plain Setup
    Ittai Abraham, Renas Bacho, Gilad Stern
  • Subcubic Coin Tossing in Asynchrony without PKI
    Mose Mizrahi, Roger Wattenhofer
12:30–13:45 Lunch break
13:45–15:40 Session 11 — Fast (Byzantine) fault tolerance
Chair: TBD

  • eAID: Elastic Asynchronous Information Dispersal with Post-Dissemination Pruning
    Rithwik Kerur, Divyakant Agrawal, Dahlia Malkhi, Michael K. Reiter, Amit Wieder
  • FinWhale: an Optimally Resilient 2 Rounds Terminating DAG Protocol
    Razya Ladelsky, Roy Friedman
  • Optimality and Trade-offs in Fast Leaderless BFT SMR
    Neil Giridharan, Ittai Abraham, Natacha Crooks, Allen Clement, Pierre Sutra, Minh Tung Nguyen
  • AegisBFT: Fast, Responsive, Fork-Resistant Consensus with Speculation Accountability
    Mohammad Mussadiq Jalalzai, Kushal Babel, Jovan Jovan, Tobias Klenze, Sourav Das, Fatima Elsheimy, Mike Setrin, John Bergschneide
  • BA · Fast Tendermint: Speeding Up a Foundational Consensus Protocol
    Preston Vander Vos, Daniel Cason
  • BA · Fast TetraBFT — Optimizing Latency Where It Matters
    Antonio J. Fernández-Pinto, Manuel Bravo, Gregory Chockler, Alexey Gotsman
  • BA · Optimal Adaptive Multi-Valued Byzantine Agreement
    Marc Dufay, Anton Paramonov, Roger Wattenhofer

— 5 min break —

Game theory in distributed computing

  • Designing Local Distributed Mechanisms
    Juho Hirvonen, Sara Ranjbaran
  • BA · Liquid democracy under vote correlation: on the fallacies of averaging and the excluded middle
    Seth Gilbert, Stefan Schmid, Santiago Schnell, Jakub Svoboda, Michelle X. Yeo
15:40–16:00 Coffee break
16:00–17:45 Session 12 — Local certification and locally checkable labelings
Chair: TBD

  • The local complexity of certifying parity
    Nicolas Bousquet, Laurent Feuilloley, Jorge Valenzuela, Sébastien Zeitoun
  • It Does Not Matter How You Define Locally Checkable Labelings
    Antonio Cruciani, Avinandan Das, Alesya Raevskaya, Jukka Suomela
  • Is a LOCAL algorithm computable?
    Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, Jukka Suomela
  • merged talk · Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties
    Chiara Piombi
  • merged talk · LCLs Beyond Bounded Degrees
    Gustav Schmid
  • BA · Superlogarithmic Gap Result for LCLs on Trees in Quantum-LOCAL
    Francesco d’Amore, Henrik Lievonen

Friday, 13 November — Workshops

Chiostro di San Pietro in Vincoli, Sapienza Università di Roma

09:00–11:00 Workshops
11:00–11:25 Coffee break
11:25–12:30 Workshops
12:30–13:45 Lunch
13:45–15:40 Workshops
15:40–16:00 Coffee break
16:00–18:00 Workshops

BA = brief announcement. The program is preliminary and may still change.