Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
From MaRDI portal
Publication:4943878
DOI10.1137/S0097539796307698zbMath0952.68159WikidataQ56386813 ScholiaQ56386813MaRDI QIDQ4943878
Michael E. Saks, Fotios Zaharoglou
Publication date: 19 March 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
54A99: Generalities in topology
Related Items
Narrowing Power vs. Efficiency in Synchronous Set Agreement, Tight bounds on the round complexity of distributed 1-solvable tasks, Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures, New combinatorial topology bounds for renaming: the lower bound, Anti-\(\Omega \): the weakest failure detector for set agreement, A topological treatment of early-deciding set-agreement, From adaptive renaming to set agreement, Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound, Algebraic topology and concurrency, The Iterated Restricted Immediate Snapshot Model, The Weakest Failure Detector for Message Passing Set-Agreement