Anti-\(\Omega \): the weakest failure detector for set agreement
type: Item
instance of: scholarly article
title: Anti-\(\Omega \): the weakest failure detector for set agreement
zbMATH Open document ID: 1231.68099
author: Piotr Zieliński
published in: Distributed Computing
publication date: 2010-09-09T00:00:00Z
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 5781471
zbMATH Keywords: failure detectors
zbMATH Keywords: set agreement
zbMATH Keywords: wait-free impossibilities
zbMATH Keywords: weakest failure detector
MaRDI profile type: Publication
full work available at URL: s00446-010-0101-9
OpenAlex ID: W2005963362
cites work: Failure detectors in loosely named systems
cites work: Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
cites work: The \(k\)-simultaneous consensus problem
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: Immediate atomic snapshots and fast renaming
cites work: The weakest failure detector for solving consensus
cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
cites work: Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
cites work: Impossibility of distributed consensus with one faulty process
cites work: Three-Processor Tasks Are Undecidable
cites work: The weakest failure detector for solving k-set agreement
cites work: Q2766889
cites work: Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
cites work: Indulgent algorithms (preliminary version)
cites work: The topological structure of asynchronous computability
cites work: Every problem has a weakest failure detector
cites work: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
cites work: Automatic Classification of Eventual Failure Detectors
DOI: 10.1007/S00446-010-0101-9
description: scientific article; zbMATH DE number 5781471