Counting-Based Impossibility Proofs for Renaming and Set Agreement
From MaRDI portal
Publication:4909423
DOI10.1007/978-3-642-33651-5_25zbMath1377.68031OpenAlexW1817055523MaRDI QIDQ4909423
Publication date: 13 March 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33651-5_25
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (8)
Structure theory of flip graphs with applications to weak symmetry breaking ⋮ A non-topological proof for the impossibility of \(k\)-set agreement ⋮ Why Extension-Based Proofs Fail ⋮ Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes ⋮ An equivariance theorem with applications to renaming ⋮ Bounds on the Step and Namespace Complexity of Renaming ⋮ Weak symmetry breaking and abstract simplex paths ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects
This page was built for publication: Counting-Based Impossibility Proofs for Renaming and Set Agreement