Time- and Space-Efficient Randomized Consensus

DOI10.1006/JAGM.1993.1022MaRDI QIDQ4696649zbMATH OpenOpenAlexFDO

Authors James Aspnes

Publication date 29 June 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1993.1022

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Cited in

(11)

• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
• Hundreds of impossibility results for distributed computing
• Atomic snapshots using lattice agreement
• Efficient execution of nondeterministic parallel programs on asynchronous systems
• On the importance of having an identity or, is consensus really universal?
• Randomized consensus in expected \(O(n ^{2})\) total work using single-writer registers
• A modular approach to shared-memory consensus, with applications to the probabilistic-write model
• Randomized consensus with regular registers
• Randomized two-process wait-free test-and-set
• Combining shared-coin algorithms
• Randomized protocols for asynchronous consensus

This page was built for publication: Time- and Space-Efficient Randomized Consensus

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