Time- and Space-Efficient Randomized Consensus

DOI10.1006/jagm.1993.1022zbMath0825.68186OpenAlexW2048499028MaRDI QIDQ4696649

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)

Related Items (11)

Efficient execution of nondeterministic parallel programs on asynchronous systems ⋮ A modular approach to shared-memory consensus, with applications to the probabilistic-write model ⋮ On the importance of having an identity or, is consensus really universal? ⋮ Atomic snapshots using lattice agreement ⋮ Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study ⋮ Randomized two-process wait-free test-and-set ⋮ Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus ⋮ Combining shared-coin algorithms ⋮ Randomized consensus with regular registers ⋮ Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers

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