Detailed Program

All paper presentations are scheduled for max. 15 minutes, plus Q&A and setup.

Registration

Opening

Keynote:   Alberto Sonnino Mysten Labs & University College London

BFT Consensus: From Academic Paper to Mainnet
Coffee break

Session 1:   Concurrency and Blockchain

  • AMECOS: A Modular Event-based Framework for Concurrent Object Specification
    T. Albouy (Univ Rennes, Inria), A. Anta (IMDEA Networks Institute), C. Georgiou (University of Cyprus, Cyprus), M. Gestin (Univ Rennes, Inria), N. Nicolaou (Algolysis Ltd), J. Wang (IMDEA Networks Institute)
  • RMR-Efficient Detectable Shared Objects for Persistent Memory and Their Applications
    S. Dhoked (University of Texas at Dallas), A. Fahmy (University of Waterloo), W. Golab (University of Waterloo), N. Mittal (University of Texas at Dallas)
  • DULL: A Fast Scalable Detectable Unrolled Lock-Based Linked List
    A. Fahmy (University of Waterloo), W. Golab (University of Waterloo)
  • Incentive Compatibility of Ethereum's PoS Consensus Protocol
    U. Pavloff (CEA-List, Université Paris-Saclay), Y. Amoussou-Guenou (Panthéon-Assas Université, CRED), S. Tucci-Piergiovanni (CEA-List, Université Paris-Saclay)
  • Optimal Multilevel Slashing for Blockchains
    K. Wood (Davidson College), H. Mendes (Davidson College), J. Pulaj (Davidson College)
Lunch

Session 2:   Self-* Algorithms

  • Crash-tolerant Exploration of Trees by Energy Sharing Mobile Agents
    Q. Bramas (ICUBE, Université de Strasbourg), T. Masuzawa (Osaka University), S. Tixeuil (Sorbonne University, CNRS)
  • Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
    G. Viglietta (University of Aizu), G. Di Luna (Sapienza University of Rome)
  • Gathering Teams of Deterministic Finite Automata on a Line
    Y. Gao (Université du Québec en Outaouais), A. Pelc (Université du Québec en Outaouais)
  • Crash-tolerant perpetual exploration with myopic luminous robots on rings
    F. Ooshita (Fukui University of Technology), N. Kitamura (Osaka University), R. Eguchi (Nara Institute of Science and Technology), M. Inoue (Nara Institute of Science and Technology), H. Kakugawa (Ryukoku University), S. Kamei (Hiroshima University), M. Shibata (Kyushu Institute of Technology), Y. Sudo (Hosei University)
  • Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
    R. Gerlach (Paderborn University), S. von der Gracht (Paderborn University), C. Hahn (University of Hamburg), J. Harbig (Paderborn University), P. Kling (University of Hamburg)
Coffee break

Session 3:   Byzantine Fault Tolerance

  • Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
    T. Albouy (Univ Rennes, Inria), D. Frey (Univ Rennes, Inria), R. Gelles (Bar-Ilan University), C. Hazay (Bar-Ilan University), M. Raynal (Univ Rennes, Inria), E. Schiller (Chalmers University of Technology), F. Taïani (Univ Rennes, Inria), V. Zikas (Purdue University)
  • Quit-Resistant Reliable Broadcast and Efficient Terminating Gather
    M. Mizrahi Erbes (ETH Zurich), R. Wattenhofer (ETH Zurich)
  • Byzantine Reliable Broadcast with Low Communication and Time Complexity
    T. Locher (DFINITY)
  • Perpetual Exploration of a Ring in Presence of Byzantine Black Hole
    P. Goswami (Sister Nivedita University), A. Bhattacharya (Indian Institute of Technology Guwahati), R. Das (Jadavpur University), P. Mandal (Indian Institute of Technology Guwahati)

Business Meeting

Welcome Reception

Registration

Keynote:   Alysson Bessani Universidade de Lisboa

The Power of Simplicity on Dependable Distributed Systems
Coffee break

Session 4:   Consensus

  • Stabilizing Consensus is impossible in Lossy Iterated Immediate Snapshot Models
    S. Felber (Vienna University of Technology), H. Galeana (TU Berlin)
  • A General Class of Reductions and Extension-Based Proofs
    Y. Shi (Tsinghua University), W. Liu (Tsinghua University)
  • How robust are synchronous consensus protocols?
    N. Milosevic (USI Lugano), D. Cason (USI Lugano), Z. Milosevic (Informal Systems), F. Pedone (USI Lugano)
  • No Symmetric Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems
    S. Gay (École Normale Supérieure), A. Mostéfaoui (LS2N, Nantes Université), M. Perrin (LS2N, Nantes Université)
Tribute to Mathieu Roy
Lunch

Session 5:   Dependability and Security

  • FaaSLoad: Fine-grained Performance and Resource Measurement for Function-as-a-Service
    M. Bacou (Samovar, Télécom SudParis)
  • Distributed Recoverable Sketches
    D. Cohen (Technion), R. Friedman (Technion), R. Shahout (Harvard University)
  • Hash & Adjust: Competitive Demand-Aware Consistent Hashing
    A. Pourdamghani (TU Berlin), C. Avin (Ben Gurion University of the Negev), R. Sama (University of Vienna), M. Shiran (TU Berlin), S. Schmid (TU Berlin)
  • Reliable Communication in Hybrid Authentication and Trust Models
    R. Chotkan (Delft University of Technology), B. Cox (Delft University of Technology), V. Rahli (University of Birmingham), J. Decouchant (Delft University of Technology)
Coffee break

Session 6:   Models and Computability

  • The Singular Optimality of Distributed Computation in LOCAL.
    F. Dufoulon (Lancaster University), G. Pandurangan (University of Houston), P. Robinson (Augusta University), M. Scquizzato (University of Padova)
  • Local problems in trees across a wide range of distributed models.
    A. Dhar (Aalto University and Indian Institute of Technology Kharagpur), E. Kujawa (Aalto University and University of Illinois Urbana-Champaign), H. Lievonen (Aalto University), A. Modanese (Aalto University), M. Muftuoglu (Aalto University), J. Studený (Aalto University), J. Suomela (Aalto University)
  • How local constraints influence network diameter and applications to LCL generalizations.
    N. Bousquet (CNRS and University of Lyon), L. Feuilloley (CNRS and University of Lyon), T. Pierron (University of Lyon)
  • On Reliability of the Extrema Propagation Technique in Random Environment.
    J. Cichoń (Wrocław University of Science and Technology), D. Dworzański (Wrocław University of Science and Technology)

Social event & banquet

Registration

Keynote:   Paola Flocchini University of Ottawa

Distributed Computing by Mobile Robots: Expanding the Horizon
Coffee break

Session 7:   Distributed Algorithms

  • Fast, Fair and Truthful Distributed Stable Matching for Common Preferences
    J. Hirvonen (Aalto University and Helsinki Institute for Information Technology), S. Ranjbaran (Aalto University)
  • Dynamic Probabilistic Reliable Broadcast
    J. Bezerra (Institut Polytechnique de Paris), V. Anikina (ITMO University), P. Kuznetsov (Institut Polytechnique de Paris), L. Schif (Akamai), S. Schmid (Technische Universität Berlin)
  • Distributed Agreement in the Arrovian Framework
    K. Wood (Davidson College), H. Mendes (Davidson College), J. Pulaj (Davidson College)
  • Self-Stabilizing Fully Adaptive Maximal Matching
    S. Bitton (Technion), Y. Emek (Technion), T. Izumi (Osaka Unversity), S. Kutten (Technion)
  • Quantum Simultaneous Protocols without Public Coins using Modified Equality Queries
    F. Le Gall (Nagoya University), O. Nadler (Tel-Aviv University), H. Nishimura (Nagoya University), R. Oshman (Tel-Aviv University)
Lunch

Session 8:   Graphs and Networks

  • Near-Optimal Resilient Labeling Schemes
    E. Huberman (Technion), K. Censor-Hillel (Technion)
  • Distributed Branching Random Walks and Their Applications
    V. Aradhya (National University of Singapore), S. Gilbert (National University of Singapore), T. Götte (University of Hamburg)
  • Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
    H. Kanaya (Nara Institute of Science and Technology), R. Eguchi (Nara Institute of Science and Technology), T. Sasada (Nara Institute of Science and Technology), M. Inoue (Nara Institute of Science and Technology)
  • Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding
    A. Figiel (TU Berlin), J. Korhonen (None), N. Olver (London School of Economics and Political Science), S. Schmid (TU Berlin)

Closing