- N. Bousquet (CNRS and University of Lyon), L. Feuilloley (CNRS and University of Lyon), T. Pierron (University of Lyon).
How local constraints influence network diameter and applications to LCL generalizations
- G. Viglietta (University of Aizu), G. Di Luna (Sapienza University of Rome).
Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
- S. Felber (Vienna University of Technology), H. Galeana (TU Berlin).
Stabilizing Consensus is impossible in Lossy Iterated Immediate Snapshot models
- F. Dufoulon (Lancaster University), G. Pandurangan (University of Houston), P. Robinson (Augusta University), M. Scquizzato (University of Padova).
The Singular Optimality of Distributed Computation in LOCAL
- 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).
Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
- E. Huberman (Technion), K. Censor-Hillel (Technion).
Near-Optimal Resilient Labeling Schemes
- V. Aradhya (National University of Singapore), S. Gilbert (National University of Singapore), T. Götte (University of Hamburg).
Distributed Branching Random Walks and Their Applications
- 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).
AMECOS: A Modular Event-based Framework for Concurrent Object Specification
- M. Bacou (Samovar, Télécom SudParis).
FaaSLoad: Fine-grained Performance and Resource Measurement for Function-as-a-Service
- M. Mizrahi Erbes (ETH Zurich), R. Wattenhofer (ETH Zurich).
Quit-Resistant Reliable Broadcast and Efficient Terminating Gather
- 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).
Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
- F. Le Gall (Nagoya University), O. Nadler (Tel-Aviv University), H. Nishimura (Nagoya University), R. Oshman (Tel-Aviv University).
Quantum Simultaneous Protocols without Public Coins using Modified Equality Queries
- R. Chotkan (Delft University of Technology), B. Cox (Delft University of Technology), V. Rahli (University of Birmingham), J. Decouchant (Delft University of Technology).
Reliable Communication in Hybrid Authentication and Trust Models
- Y. Shi (Tsinghua University), W. Liu (Tsinghua University).
A General Class of Reductions and Extension-Based Proofs
- P. Goswami (Sister Nivedita University), A. Bhattacharya (Indian Institute of Technology Guwahati), R. Das (Jadavpur University), P. Mandal (Indian Institute of Technology Guwahati).
Perpetual Exploration of a Ring in Presence of Byzantine Black Hole
- T. Locher (DFINITY).
Byzantine Reliable Broadcast with Low Communication and Time Complexity
- Y. Gao (Université du Québec en Outaouais), A. Pelc (Université du Québec en Outaouais).
Gathering Teams of Deterministic Finite Automata on a Line
- 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).
Crash-tolerant perpetual exploration with myopic luminous robots on rings
- D. Cohen (Technion), R. Friedman (Technion), R. Shahout (Harvard University).
Distributed Recoverable Sketches
- R. Gerlach (Paderborn University), S. von der Gracht (Paderborn University), C. Hahn (University of Hamburg), J. Harbig (Paderborn University), P. Kling (University of Hamburg).
Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
- 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).
Local problems in trees across a wide range of distributed models
- J. Hirvonen (Aalto University and Helsinki Institute for Information Technology), S. Ranjbaran (Aalto University).
Fast, Fair and Truthful Distributed Stable Matching for Common Preferences
- 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).
Hash & Adjust: Competitive Demand-Aware Consistent Hashing
- J. Cichoń (Wrocław University of Science and Technology), D. Dworzański (Wrocław University of Science and Technology).
On Reliability of the Extrema Propagation Technique in Random Environment
- N. Milosevic (USI Lugano), D. Cason (USI Lugano), Z. Milosevic (Informal Systems), F. Pedone (USI Lugano).
How robust are synchronous consensus protocols?
- S. Dhoked (University of Texas at Dallas), A. Fahmy (University of Waterloo), W. Golab (University of Waterloo), N. Mittal (University of Texas at Dallas).
RMR-Efficient Detectable Shared Objects for Persistent Memory and Their Applications
- A. Figiel (TU Berlin), J. Korhonen (None), N. Olver (London School of Economics and Political Science), S. Schmid (TU Berlin).
Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding
- Q. Bramas (ICUBE, Université de Strasbourg), T. Masuzawa (Osaka University), S. Tixeuil (Sorbonne University, CNRS).
Crash-tolerant Exploration of Trees by Energy Sharing Mobile Agents
- 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).
Dynamic Probabilistic Reliable Broadcast
- A. Fahmy (University of Waterloo), W. Golab (University of Waterloo).
DULL: A Fast Scalable Detectable Unrolled Lock-Based Linked List
- U. Pavloff (CEA-List, Université Paris-Saclay), Y. Amoussou-Guenou (Panthéon-Assas Université, CRED), S. Tucci-Piergiovanni (CEA-List, Université Paris-Saclay).
Incentive Compatibility of Ethereum's PoS consensus protocol
- K. Wood (Davidson College), H. Mendes (Davidson College), J. Pulaj (Davidson College).
Distributed Agreement in the Arrovian Framework
- K. Wood (Davidson College), H. Mendes (Davidson College), J. Pulaj (Davidson College).
Optimal Multilevel Slashing for Blockchains
- S. Bitton (Technion), Y. Emek (Technion), T. Izumi (Osaka Unversity), S. Kutten (Technion).
Self-Stabilizing Fully Adaptive Maximal Matching
- S. Gay (École Normale Supérieure), A. Mostéfaoui (LS2N, Nantes Université), M. Perrin (LS2N, Nantes Université).
No Symmetric Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems