Papers accepted to PODC 2026

  • 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 (slightly outdated)
  • 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)

Paper accepted to SIROCCO 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.

POPL 2026 paper is online

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.