Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes

DOI10.1007/978-3-319-31580-5_7zbMath1426.68185arXiv1506.03944OpenAlexW1894549304MaRDI QIDQ4608477

Dmitry N. Kozlov

Publication date: 20 March 2018

Published in: Springer INdAM Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.03944

zbMATH Keywords

protocol complexesstandard chromatic subdivisionweak symmetry breaking

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) PL-topology (57Q99)

Related Items (3)

Structure theory of flip graphs with applications to weak symmetry breaking ⋮ Bounds on the Step and Namespace Complexity of Renaming ⋮ All binomial identities are orderable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topology of the immediate snapshot complexes
• All binomial identities are orderable
• New combinatorial topology bounds for renaming: the lower bound
• Structure theory of flip graphs with applications to weak symmetry breaking
• Chromatic subdivision of a simplicial complex
• Topology of the view complex
• New combinatorial topology upper and lower bounds for renaming
• The topological structure of asynchronous computability
• Impossibility Results for Distributed Computing
• Counting-Based Impossibility Proofs for Renaming and Set Agreement
• Upper bound on the complexity of solving hard renaming
• New combinatorial topology bounds for renaming
• Weak symmetry breaking and abstract simplex paths
• Combinatorial algebraic topology

This page was built for publication: Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes