Tight bounds for \(k\)-set agreement with limited-scope failure detectors
type: Item
instance of: scholarly article
title: Tight bounds for \(k\)-set agreement with limited-scope failure detectors
zbMATH Open document ID: 1264.68086
published in: Distributed Computing
publication date: 2013-06-07T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6172096
author: Maurice Herlihy
author: Lucia Draque Penso
MaRDI profile type: Publication
full work available at URL: s00446-005-0141-8
OpenAlex ID: W2077963177
cites work: Q4437135
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: The weakest failure detector for solving consensus
cites work: Unreliable failure detectors for reliable distributed systems
cites work: Tight bounds for k -set agreement
cites work: Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
cites work: Algebraic spans
cites work: Unifying synchronous and asynchronous message-passing models
cites work: Q4436047
cites work: The topological structure of asynchronous computability
cites work: Q4437114
cites work: k-set agreement with limited accuracy failure detectors
cites work: Q3827224
cites work: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
cites work: Q5522742
cites work: Structured derivations of consensus algorithms for failure detectors
DOI: 10.1007/S00446-005-0141-8
description: scientific article; zbMATH DE number 6172096