The combinatorial structure of wait-free solvable tasks (extended abstract)

DOI10.1007/3-540-61769-8_21zbMATH Open1541.68145MaRDI QIDQ6570926

Sergio Rajsbaum, Hagit Attiya

Publication date: 11 July 2024

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Renaming in an asynchronous environment
• A combinatorial characterization of the distributed 1-solvable tasks
• Reaching approximate agreement in the presence of faults
• Impossibility of distributed consensus with one faulty process
• Are wait-free algorithms fast?
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Wait-free k-set agreement is impossible
• The asynchronous computability theorem for t-resilient tasks
• Set consensus using arbitrary objects (preliminary version)
• Algebraic spans
• Immediate atomic snapshots and fast renaming

This page was built for publication: The combinatorial structure of wait-free solvable tasks (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570926)