3 papers
cs.DC2026
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…
cs.DC2026
Space-Efficient Lock-Free Linear-Probing Hash Table
Hagit Attiya, Rotem Oshman, Noa Schiller
Linear probing is one of the simplest and most space-efficient approaches to hash table design, and is widely used in sequential settings due to its compact memory layout. However,…
cs.DC2025
History-Independent Concurrent Hash Tables
Hagit Attiya, Michael A. Bender, MartÃn Farach-Colton +2
A history-independent data structure does not reveal the history of operations applied to it, only its current logical state, even if its internal state is examined. This paper stu…