1 citations · 2 across the 5 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DC2011★ 1 cited
The Space Complexity of Long-lived and One-Shot Timestamp Implementations
Maryam Helmi, Lisa Higham, Eduardo Pacheco +1
This paper is concerned with the problem of implementing an unbounded timestamp object from multi-writer atomic registers, in an asynchronous distributed system of n processors wit…
cs.DC2011★ 1 cited
Linearizable Implementations Do Not Suffice for Randomized Distributed Computation
Wojciech Golab, Lisa Higham, Philipp Woelfel
Linearizability is the gold standard among algorithm designers for deducing the correctness of a distributed algorithm using implemented shared objects from the correctness of the…