4 citations · 8 across the 4 of their papers we have counts for
5 papers
On implementing SWMR registers from SWSR registers in systems with Byzantine failures
Xing Hu, Sam Toueg
The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport's pioneering work [13], this proble…
On Register Linearizability and Termination
Vassos Hadzilacos, Xing Hu, Sam Toueg
In a seminal work, Golab et al. showed that a randomized algorithm that works with atomic objects may lose some of its properties if we replace the atomic objects that it uses with…
On Linearizability and the Termination of Randomized Algorithms
Vassos Hadzilacos, Xing Hu, Sam Toueg
We study the question of whether the "termination with probability 1" property of a randomized algorithm is preserved when one replaces the atomic registers that the algorithm uses…
Randomized Consensus with Regular Registers
Vassos Hadzilacos, Xing Hu, Sam Toueg
The well-known randomized consensus algorithm by Aspnes and Herlihy for asynchronous shared-memory systems was proved to work, even against a strong adversary, under the assumption…
On Atomic Registers and Randomized Consensus in M&M Systems
Vassos Hadzilacos, Xing Hu, Sam Toueg
Motivated by recent distributed systems technology, Aguilera et al. introduced a hybrid model of distributed computing, called message-and-memory model or m&m model for short [1].…