2 citations · 3 across the 3 of their papers we have counts for
6 papers
Non-Leaking Concurrent Objects
Hagit Attiya, Rotem Oshman, Noa Schiller +1
Abstract specifications of concurrent objects determine which values operations may return, but they also implicitly constrain which information operations may know, for example th…
Auditable Shared Objects: From Registers to Synchronization Primitives
Hagit Attiya, Antonio Fernández Anta, Alessia Milani +2
Auditability allows to track operations performed on a shared object, recording who accessed which information. This gives data owners more control on their data. Initially studied…
Auditing without Leaks Despite Curiosity
Hagit Attiya, Antonio Fernández Anta, Alessia Milani +2
\textit{Auditing} data accesses helps preserve privacy and ensures accountability by allowing one to determine who accessed (potentially sensitive) information. A prior formal defi…
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers
Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud +2
The celebrated Asynchronous Computability Theorem of Herlihy and Shavit (STOC 1993 and STOC 1994) provided a topological characterization of the tasks that are solvable in a distri…
Upper and Lower Bounds for Deterministic Approximate Objects
Danny Hendler, Adnane Khattabi, Alessia Milani +1
Relaxing the sequential specification of shared objects has been proposed as a promising approach to obtain implementations with better complexity. In this paper, we study the step…
A Topological Perspective on Distributed Network Algorithms
Armando Castañeda, Pierre Fraigniaud, Ami Paz +3
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems…