activity
20102026
most citedSafety of Deferred Update in Transactional Memory

3 citations · 14 across the 23 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

cs.DC2023★ 2 cited

The Synchronization Power of Auditable Registers

Hagit Attiya, Antonella Del Pozzo, Alessia Milani +2

Auditability allows to track all the read operations performed on a register. It abstracts the need of data owners to control access to their data, tracking who read which informat…

cs.DC2023

Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit

Hagit Attiya, Jennifer L. Welch

Algorithms to solve fault-tolerant consensus in asynchronous systems often rely on primitives such as crusader agreement, adopt-commit, and graded broadcast, which provide weaker a…

cs.DC2023

One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks

Hagit Attiya, Pierre Fraigniaud, Ami Paz +1

The paper compares two generic techniques for deriving lower bounds and impossibility results in distributed computing. First, we prove a speedup theorem (a-la Brandt, 2019), for w…

cs.DC2023

Recoverable and Detectable Self-Implementations of Swap

Tomer Lev Lehman, Hagit Attiya, Danny Hendler

Recoverable algorithms tolerate failures and recoveries of processes by using non-volatile memory. Of particular interest are self-implementations of key operations, in which a rec…

cs.DC2023

Topological Characterization of Task Solvability in General Models of Computation

Hagit Attiya, Armando Castañeda, Thomas Nowak

The famous asynchronous computability theorem (ACT) relates the existence of an asynchronous wait-free shared memory protocol for solving a task with the existence of a simplicial…