scientific article
From MaRDI portal
Publication:3138972
zbMath0800.68463MaRDI QIDQ3138972
Nir Shavit, Heather Woll, Michael E. Saks
Publication date: 20 October 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Dynamic load balancing with group communication ⋮ Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler ⋮ Randomized two-process wait-free test-and-set ⋮ Randomized protocols for asynchronous consensus ⋮ Meeting the deadline: on the complexity of fault-tolerant continuous gossip ⋮ Combining shared-coin algorithms ⋮ Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers ⋮ Doing-it-all with bounded work and communication ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll ⋮ On the optimal space complexity of consensus for anonymous processes ⋮ Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers ⋮ Cooperative computing with fragmentable and mergeable groups ⋮ Communication-efficient randomized consensus ⋮ The epigenetic consensus problem
This page was built for publication:
