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)