- Warren Zhu (University of Toronto)
A Hierarchy of Unrestricted Deterministic Objects with Consensus Number 1
- Timothé Albouy, Antonio Fernandez Anta (IMDEA Software Institute); Chryssis Georgiou (University of Cyprus); Nicolas Nicolaou (Algolysis, LTD); Junlang Wang (IMDEA Networks)
Tight Conditions for Binary-Output Tasks under Crashes
- Pavel Hubáček (Charles University, Faculty of Mathematics and Physics and Institute of Mathematics of the Czech Academy of Sciences); Jan Václavek (Firefish Labs); Michelle Yeo (National University of Singapore)
Foundations of Fiat-Denominated Loans Collateralized by Cryptocurrencies
- Bo Pan, Maria Potop-Butucaru (Sorbonne Université, LIP6, Paris, France)
Mobile Byzantine Agreement in a Trusted World
- Ignacio Amores-Sesar (Aarhus Univeristy); Christian Cachin (University of Bern); Simon Holmgaard Kamp (Ruhr University Bochum); Juan Villacis (University of Bern)
Weaker Assumptions for Asymmetric Trust
- Timothé Albouy (IMDEA Software); Davide Frey (Inria); Mathieu Gestin (CEA); Michel Raynal, François Taïani (IRISA)
Contention-Aware Cooperation
- Keren Censor-Hillel (Technion); Pedro Soto (Virginia Tech)
Computing in a Faulty Congested Clique
- David Bromberg (Univ Rennes, Inria, CNRS, IRISA); Jérémie Decouchant (TU Delft, The Netherlands); Manon Sourisseau, François Taïani (Univ Rennes, Inria, CNRS, IRISA)
Formalizing Rollback Netcodes for Robust and Real-Time Client-Server Architectures
- Thomas Locher (DFINITY)
Efficient Byzantine Reliable Broadcast in the Failure Case
- Yannis Coutouly, Emmanuel Godard (Aix Marseille University)
A General Input-Dependent Colorless Computability Theorem and Applications
- Adam Ganczorz, Tomasz Jurdzinski (University of Wroclaw); Andrzej Pelc (Departement d'informatique, Universite du Quebec en Outaouais)
Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
- Shachar Meir (The Weizmann Institute of Science); Hugo Mirault (Augusta University); David Peleg (The Weizmann Institute of Science); Peter Robinson (Augusta University)
Time-Optimal and Energy-Efficient Deterministic Consensus
- Mose Mizrahi Erbes, Roger Wattenhofer (ETH Zurich)
Asynchronous Approximate Agreement with Quadratic Communication
- Hagit Attiya (Technion); Panagiota Fatourou (University of Crete, CSD and FORTH, ICS); Eleftherios Kosmas (Hellenic Mediterranean University); Yuanhao Wei (University of British Columbia)
Recoverable Lock-Free Locks
- John Augustine (Indian Institute of Technology Madras); Soumyottam Chatterjee (CISPA); Valerie King (University of Victoria); Manish Kumar (Indian Institute of Technology Madras); Shachar Meir, David Peleg (The Weizmann Institute of Science)
Distributed Download from an External Data Source in Asynchronous Faulty Settings
- Thomas Boudier, Filippo Casagrande (Gran Sasso Science Institute); Avinandan Das, Massimo Equi, Henrik Lievonen, Augusto Modanese, Ronja Stimpert (Aalto University)
Orientation does not help with 3-coloring a grid in online-LOCAL
- Wenkai Dai (unaffiliated); Klaus-Tycho Foerster (TU Dortmund); Stefan Schmid (TU Berlin)
Fast Rerouting Against Dynamic Failures: 2-Resilience via Ear-Decomposition and Planarity
- Eli Gafni (UCLA); Giuliano Losa (Stellar Development Foundation); Michel Raynal (Univ. Rennes, Inria, CNRS, IRISA); Gadi Taubenfeld (Reichman University)
Solving Tasks with Fewer Registers than Processes
- Fedor Ryabinin, Alexey Gotsman (IMDEA Software Institute); Pierre Sutra (Télécom SudParis)
Making Democracy Work: Fixing and Simplifying Egalitarian Paxos
- Marc Fuchs, Fabian Kuhn (University of Freiburg)
Distributed (Δ+1)-Coloring in Graphs of Bounded Neighborhood Independence
- Alan Ernesto Arteaga Vázquez (Universdad Nacional Autónoma de México (UNAM))
On Time-Optimal, Fault-Tolerant Algorithms for Connected Consensus Beyond Grade Two
- Sebastian Brandt (CISPA Helmholtz Center for Information Security); Fabian Kuhn, Zahra Parsaeian (University of Freiburg)
On the Complexity of Distributed Edge Coloring and Orientation Problems
- David Cifuentes-Núñez (Universidad de Chile); Pedro Montealegre (Universidad Adolfo Ibáñez); Ivan Rapaport (Universidad de Chile)
Recognizing Hereditary Properties in the Presence of Byzantine Nodes
- Andrei Arusoaie, Claudiu-Nicu Bărbieru, Oana-Otilia Captarencu (Alexandru Ioan Cuza University of Iaşi); Pascal Felber (University of Neuchâtel); Corentin Libert (UCLouvain); Emanuel Onica (Alexandru Ioan Cuza University of Iaşi); Etienne Rivière (UCLouvain); Valerio Schiavoni, Peterson Yuhala (Université de Neuchâtel)
Where to Place your TEE? In Search of a Censorship-Resilient Design for Rollup Sequencers
- Chen Avin (Ben-Gurion University of the Negev); Robert Elsässer (University of Salzburg); Aleksander Figiel, Darya Melnyk, Stefan Schmid (TU Berlin)
Demand-Aware Small-World Networks on Clustered Demands
- Leqi Zhu (University of Manitoba); Faith Ellen, Shihao Liu (University of Toronto); Eli Gafni (University of California, Los Angeles); Rati Gelashvili (Aptos Labs)
How exhaustive does an extension-based proof need to be?
- Costas Busch (Augusta University); Pawel Garncarek (Wroclaw University); Dariusz Kowalski (Augusta University)
Byzantine-Tolerant Phase Clock
- Matthias Bentert, Esra Ceylan (TU Berlin); Valentin Huebner (ISTA Austria); Stefan Schmid (TU Berlin); Jiri Srba (Aalborg University)
Fast Re-Routing in Networks: On the Complexity of Perfect Resilience
- Shota Takahashi (Hosei University); Haruki Kanaya (Nara Institute of Science and Technology); Shoma Hiraoka (Osaka University); Ryota Eguchi (Nara Institute of Science and Technology); Yuichi Sudo (Hosei University)
Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
- Petr Kuznetsov (LTCI, Telecom Paris, Institut Polytechnique de Paris); Nathan Schrodt (Technische Universität Darmstadt)
Resolving Conflicts with Grace: Dynamically Concurrent Universality
- Masahiro Shibata (Kyushu Institute of Technology); Naoki Kitamura (Osaka University); Ryota Eguchi (NAIST); Yuichi Sudo (Hosei University); Junya Nakamura (Toyohashi University of Technology); Yonghwan Kim, Yoshiaki Katayama (Nagoya Institute of Technology); Toshimitsu Masuzawa (Notre Dame Seishin University); Quentin Bramas (University of Strasbourg); Sebastien Tixeuil (Sorbonne Université)
Uniform deployment of mobile robots in complete bipartite graphs
- Andy Lewis (LSE); Ehud Shapiro (Weizmann Institute of Science)
Morpheus Consensus: Excelling on trails and autobahns
- Alireza Kavousi (University College London); Duc V. Le (Visa Research); Philipp Jovanovic (University College London); George Danezis (Mysten Labs, University College London)
BlindPerm: Efficient MEV Mitigation with an Encrypted Mempool and Permutation