Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

DOI10.1007/978-3-642-10631-6_95zbMath1273.68065OpenAlexW2146307966MaRDI QIDQ3652281

Dan Alistarh, Corentin Travers, Rachid Guerraoui

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_95

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

A modular approach to shared-memory consensus, with applications to the probabilistic-write model ⋮ Tight bounds for adopt-commit objects ⋮ Generating fast indulgent algorithms ⋮ Faster randomized consensus with an oblivious adversary

This page was built for publication: Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement