- Fernando Pedone and Enrique Fynn (University of Lugano, Switzerland), Robert Soulé (Yale University), and Zarko Milosevic and Ethan Buchman (Informal Systems).
Robust and Fast Blockchain State Synchronization
- Colette Johnen and Adnane Khattabi (Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, Talence, France) and Alessia Milani (Univ. Aix-Marseille, CNRS, LIS, UMR 7020, Marseille, France).
Efficient Wait-free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers
- Gali Sheffi and Erez Petrank (Technion) and Pedro Ramalhete (Cisco Systems).
EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation
- Neta Rozen Schiff (The Hebrew University of Jerusalem), Klaus-Tycho Foerster (TU Dortmund), Stefan Schmid (University of Vienna & TU Berlin), and David Hay (The Hebrew University of Jerusalem).
Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks
- Shir Cohen and Idit Keidar (Technion) and Alexander Spiegelman (Aptos).
Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words
- Hagit Attiya (Technion) and Faith Ellen (University of Toronto).
The Step Complexity of Multidimensional Approximate Agreement
- Ignacio Amores-Sesar and Christian Cachin (University of Bern) and Enrico Tedeschi (The Artic University of Norway).
Melting the Snow: A Security Analysis of Avalanche Consensus
- Trevor Brown and Rosina Kharal (University of Waterloo).
Performance Anomalies in Concurrent Data Structure Microbenchmarks
- Shihao Liu (University of Toronto).
The Impossibility of Approximate Agreement on a Large Class of Graphs
- Taichi Inoue, Naoki Kitamura, Taisuke Izumi, and Toshimitsu Masuzawa (Osaka University).
Computational Power of A Single Oblivious Mobile Agent in Two-Edge-Connected Graphs
- Pierre Fraigniaud (IRIF, Université Paris Cité and CNRS, France.), Pedro Montealegre (Universidad Adolfo Ibáñez), Pablo Paredes and Ivan Rapaport (Universidad de Chile), Martín Ríos-Wilson (Universidad Adolfo Ibáñez), and Ioan Todinca (Université d'Orléans).
Computing Power of Hybrid Models in Synchronous Networks
- Darya Melnyk and Jukka Suomela (Aalto University) and Neven Villani (ENS Paris-Saclay).
Mending Partial Solutions With Few Changes
- Timothé Albouy (IRISA), Davide Frey (Inria), and Michel Raynal and François Taïani (IRISA).
A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary
- Rodrigo Queiroz Saramago, Hein Meling, and Leander Jehl (University of Stavanger).
A Privacy-Preserving and Transparent Certification System for Digital Credentials
- Yuval Emek, Yuval Gil, and Noga Harlev (Technion).
Design of Self-Stabilizing Approximation Algorithms Via a Primal-Dual Approach
- Ittai Abraham (VMWare Research) and Gilad Stern (The Hebrew University of Jerusalem).
New Dolev-Reischuk Lower Bounds Meet Blockchain Eclipse Attacks
- Yonghwan Kim (Nagoya Institute of Technology), Masahiro Shibata (Kyushu Institute of Technology), Yuichi Sudo (Hosei University), Junya Nakamura (Toyohashi University of Technology), Yoshiaki Katayama (Nagoya Institute of Technology), and Toshimitsu Masuzawa (Osaka University).
Gathering of Mobile Robots with Defected Views
- Jannik Castenow, Jonas Harbig, and Daniel Jung (Paderborn University), Peter Kling (Universität Hamburg), and Till Knollmann and Friedhelm Meyer auf der Heide (Paderborn University).
A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility
- John Augustine, Arnhav Datar, and Nischith Shadagopan M N (Indian Institute of Technology Madras).
Randomized Byzantine Gathering in Rings
- Christian Cachin (University of Bern), Giuliano Losa (Stellar Development Foundation), and Luca Zanolini (University of Bern).
Quorum Systems in Permissionless Networks
- Sarah Azouvi (Protocol Labs), Christian Cachin and Duc V. Le (University of Bern), Marko Vukolic (Protocol Labs), and Luca Zanolini (University of Bern).
Modeling Resources in Permissionless Longest-chain Total-order Broadcast
- Bernadette Charron-Bost (DI ENS, École Normale Supérieure, 75005 Paris, France) and Louis Penet de Monterno (École polytechnique, IP Paris, 91128 Palaiseau, France).
Self-stabilizing clock synchronization in dynamic networks
- Petra Berenbrink (Universität Hamburg), Amin Coja-Oghlan, Oliver Gebhard, and Max Hahn-Klimroth (TU Dortmund University), Dominik Kaaser (TU Hamburg), and Malin Rau (Universität Hamburg).
On the Hierarchy of Distributed Majority Protocols
- Sravya Yandamuri (Duke University), Ittai Abraham (VMware Research), and Kartik Nayak and Michael Reiter (Duke University).
Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption
- Jared Coleman (University of Southern California), Evangelos Kranakis (Carleton University, Ottawa, Ontario, Canada), Danny Krizanc (Wesleyan University, Middletown CT, USA), and Oscar Morales Ponce (California State University, Long Beach, CA, USA).
Line Search for an Oblivious Moving Target