Weak symmetry breaking and abstract simplex paths

DOI10.1017/S0960129514000085zbMath1361.68171arXiv1311.7289OpenAlexW2129995086MaRDI QIDQ5740661

Dmitry N. Kozlov

Publication date: 27 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Structure theory of flip graphs with applications to weak symmetry breaking ⋮ Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes ⋮ Bounds on the Step and Namespace Complexity of Renaming

Cites Work

• Chromatic subdivision of a simplicial complex
• The topological structure of asynchronous computability
• Renaming in an asynchronous environment
• Counting-Based Impossibility Proofs for Renaming and Set Agreement
• An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing

This page was built for publication: Weak symmetry breaking and abstract simplex paths