scientific article; zbMATH DE number 432838

zbMATH Open0800.68463MaRDI QIDQ3138972FDOQ3138972

Michael Saks, Nir Shavit, Heather Woll

Publication date: 20 October 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

consensus algorithmdistributed systemsresilient algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Cited In (14)

• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• Dynamic load balancing with group communication
• Communication-efficient randomized consensus
• On the optimal space complexity of consensus for anonymous processes
• Randomized two-process wait-free test-and-set
• Cooperative computing with fragmentable and mergeable groups
• Combining shared-coin algorithms
• Randomized protocols for asynchronous consensus
• Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• The epigenetic consensus problem
• Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
• Doing-it-all with bounded work and communication

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138972)