5 citations · 21 across the 18 of their papers we have counts for
6 papers · 1 filter
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…
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,…
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…
History-Independent Concurrent Objects
Hagit Attiya, Michael A. Bender, Martin Farach-Colton +2
A data structure is called history independent if its internal memory representation does not reveal the history of operations applied to it, only its current state. In this paper…
Optimal Gradient Clock Synchronization in Dynamic Networks
Fabian Kuhn, Christoph Lenzen, Thomas Locher +1
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with…
Gradient Clock Synchronization using Reference Broadcasts
Fabian Kuhn, Rotem Oshman
In this paper we suggest a method by which reference broadcast synchronization (RBS), and other methods of estimating clock values, can be incorporated in standard clock synchroniz…