• Randomized Consensus in O(n loglog n) Expected Steps Using Single-Writer Registers, Hagit Attiya (Technion), Yoav Ben Shimon (Tel-Aviv University)
• Asynchronous Byzantine Lattice Agreement with Logarithmic Response Time and Optimal Resilience, Hagit Attiya (Technion), Yao David Kolegain (Aix-Marseille University, CNRS-LIS), Arnaud Labourel (Aix-Marseille University, CNRS-LIS), Alessia Milani (Aix-Marseille University, CNRS-LIS)
• Mapped MCS: A Standard-Interface Lock without Obstruction by Subsequent Processes, Tomer Cory (Technion), Niv Sulimany (Technion), Hagit Attiya (Technion), Erez Petrank (Technion)

Two papers were accepted to DISC 2026:

• Non-Leaking Concurrent Objects 
  Hagit Attiya, Rotem Oshman, Noa Schiller, Corentin Travers arxiv
  This paper won the best paper award.
• Space-Efficient Lock-Free Linear-Probing Hash Table
  Hagit Attiya, Rotem Oshman, Noa Schiller arxiv

The paper “The Synchronization Power of Auditable Single-Writer Registers” (with Antonella Del Pozzo, Antonio Fernandez Anta, Alessia Milani, Alexandre Rapetti and Corentin Travers) was published in Journal on Parallel and Distributed Computing.

• Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing
  Hagit Attiya (Technion); Armando Castañeda (Instituto de Matemáticas, Universidad Nacional Autónoma de México (UNAM)); Constantin Enea (Ecole Polytechnique, LIX) arxiv
• Why Canonical-Round Algorithms Fail for Optimal Byzantine Resilience
  Hagit Attiya, Itay Flam (Technion); Jennifer Welch (TAMU) arxiv
• Brief announcement: A Space-Efficient Lock-Free Linear-Probing Hash Table
  Hagit Attiya (Technion); Rotem Oshman (Tel Aviv University and NYU); Noa Schiller (Tel Aviv University) arxiv

EATCS fellows class of 2026

The paper “Equivalence and Separation between Heard-Of and Asynchronous Message-Passing Models” with Armando Castañeda, Dhrubajyoti Ghosh, Thomas Nowak, was accepted to SIROCCO 2026. arxiv

The paper shows that with a majority of correct processes, the Heard-Of model is  equivalent to the standard asynchronous message-passing model with respect to the solvability of colorless tasks, and that for colored tasks the equivalence holds only for one failure. The proofs proceed through bidirectional simulations between and via an intermediate model that captures a notion of silenced processes.

Our paper Recoverable Lock-Free Locks (with Panagiota Fatourou, Eleftherios Kosmas and Yuanhao Wei) has won the Best Systems Paper Award at OPODIS 2025.

My talk “Specifying binding and commitment with ghost outputs and strong refinement” in FRIDA 2025 is now on youtube.
(For some reason, only the audio was recorded.)

The paper Arbitration-Free Consistency is Available (and Vice Versa), with Constantin Enea and Enrique Román-Calvo was accepted to POPL 2026. arxiv

The paper shows that a distributed object has an available implementation (in which operations can be answered based on local information) if and only if its consistency model does not require a total arbitration order to resolve visibility or read  dependencies.

Two papers will appear in DISC 2025

• Auditable Shared Objects: From Registers to Synchronization Primitives, by Hagit Attiya, Antonio Fernández Anta, Alessia Milani, Alexandre Rapetti, and Corentin Travers arxiv
• Brief Announcement: Communication Patterns for Optimal Resilience, by Hagit Attiya, Itay Flam, and Jennifer L. Welch arxiv