- H. Attiya, A. Pozzo, A. Milani, U. Pavloff, A. Rapetti.
The Synchronization Power of Auditable Registers
- C. Feletti, C. Mereghetti, B. Palano.
O(log n)-time Uniform Circle Formation for Asynchronous Opaque Luminous Robots
- H. Attiya, J. Welch.
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit
- J. Weber, T. Chhabra, A. Richa, J. Daymude.
Energy-Constrained Programmable Matter Under Unfair Adversaries
- A. Constantinescu, D. Ghinea, L. Heimbach, Z. Wang, R. Wattenhofer.
A Fair and Resilient Decentralized Clock Network for Transaction Ordering
- L. Tseng, C. Sardina.
Byzantine Consensus in Abstract MAC Layer
- C. Cooper, T. Radzik, T. Shiraga.
Discrete Incremental Voting
- J. Hirvonen, L. Schmid, K. Chatterjee, S. Schmid.
On the convergence time in graphical games: a locality-sensitive approach
- O. Alpos, I. Amores-Sesar, C. Cachin, M. Yeo.
Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks
- C. Carlson, E. Vigoda, D. Frishberg.
Improved Distributed Algorithms for Random Colorings
- A. Lewis-Pye, I. Abraham.
Fever: Optimal Responsive View Synchronisation
- R. Fakhoury, A. Braginsky, I. Keidar, Y. Zuriel.
Nova: Safe Off-Heap Memory Allocation and Reclamation
- Y. Gil.
Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
- S. Asbell, E. Ruppert.
A Wait-Free Deque with Polylogarithmic Step Complexity
- S. Bonomi, G. Farina, S. Tixeuil.
Reliable Broadcast despite Mobile Byzantine Faults
- A. Livshits, Y. Moses.
Probable Approximate Coordination
- J. Lee, L. Schmid, S. Yun.
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks
- A. Pastoriza, G. Chockler, A. Gotsman.
Fault-tolerant computing with unreliable channels
- A. Agrawal, J. Augustine, D. Peleg, S. Ramachandran.
Local Problems in the SUPPORTED Model
- J. Ménétrey, A. Grueter, P. Yuhala, J. Oeftiger, P. Felber, M. Pasin, V. Schiavoni.
A Holistic Approach for Trustworthy Distributed Systems with WebAssembly and TEEs
- T. Lehman, H. Attiya, D. Hendler.
Recoverable and Detectable Self-Implementations of Swap
- A. Navarra, F. Piselli.
Silent Programmable Matter: Coating
- S. Kutten, P. Robinson, M. Tan.
Tight Bounds on the Message Complexity of Distributed Tree Verification
- E. Aldema Tshuva, R. Oshman.
Polynomial Time Local Decision
- P. Flocchini, N. Santoro, Y. Sudo, K. Wada.
On Asynchrony, Memory, and Communication: Separations and Landscapes
- I. Abraham, N. Ben-David, G. Stern, S. Yandamuri.
On the Round Complexity of Asynchronous Crusader Agreement
- A. Das, P. Fraigniaud, A. Rosen.
Distributed Partial Coloring via Gradual Rounding
- J. Bezerra de Araújo, P. Kuznetsov.
A Tight Bound on Multiple Spending in Decentralized Cryptocurrencies
- H. Attiya, J. Welch.
Bounds on Worst-Case Responsiveness for Agreement Algorithms
- G. Di Luna, P. Flocchini, G. Prencipe, N. Santoro.
Black Hole Search in Dynamic Rings: The Scattered Case
- R. Shahout, R. Friedman.
Sketching the Path to Efficiency: Lightweight Learned Cache Replacement
- V. Kowalski, A. Mostefaoui, M. Perrin.
Atomic Register Abstractions for Byzantine-Prone Distributed Systems