Anti-Ω

DOI10.1145/1400751.1400761zbMath1301.68071OpenAlexW1973236988MaRDI QIDQ2934332

Piotr Zieliński

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1400751.1400761

zbMATH Keywords

set agreementfailure detectorswait-free impossibilitiesweakest failure detector ever

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (5)

The \(k\)-simultaneous consensus problem ⋮ On the weakest failure detector ever ⋮ The Weakest Failure Detector for Message Passing Set-Agreement ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems ⋮ Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems

This page was built for publication: Anti-Ω