55 citations · 111 across the 14 of their papers we have counts for
Showing 2011 · cs.DCShow all
2 papers · 2 filters
cs.DC2011
A Complexity Separation Between the Cache-Coherent and Distributed Shared Memory Models
Wojciech Golab
We consider asynchronous multiprocessor systems where processes communicate by accessing shared memory. Exchange of information among processes in such a multiprocessor necessitate…
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…