A topological treatment of early-deciding set-agreement
type: Item
instance of: scholarly article
title: A topological treatment of early-deciding set-agreement
zbMATH Open document ID: 1157.68015
author: Rachid Guerraoui
author: Bastian Pochon
author: Maurice Herlihy
published in: Theoretical Computer Science
publication date: 2009-03-02T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 5522267
zbMATH Keywords: \(k\)-set-agreement
zbMATH Keywords: topology
zbMATH Keywords: time complexity
zbMATH Keywords: lower bound
zbMATH Keywords: early decision
zbMATH Keywords: local decision
zbMATH Keywords: optimistic algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.10.002
OpenAlex ID: W2150475919
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: Uniform consensus is harder than consensus
cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
cites work: Tight bounds for k -set agreement
cites work: Early stopping in Byzantine agreement
cites work: The inherent price of indulgence
cites work: Distributed Computing
cites work: Impossibility of distributed consensus with one faulty process
cites work: Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
cites work: From a static impossibility to an adaptive lower bound
cites work: A note on set agreement with omission failures
cites work: Algebraic spans
cites work: Unifying synchronous and asynchronous message-passing models
cites work: The topological structure of asynchronous computability
cites work: Q3126969
cites work: Q3827224
cites work: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
DOI: 10.1016/J.TCS.2008.10.002
description: scientific article; zbMATH DE number 5522267