arXiv Open Access 2013

Weak symmetry breaking and abstract simplex paths

Dmitry N. Kozlov

Lihat Sumber

Abstrak

Motivated by questions in theoretical distributed computing, we develop the combinatorial theory of abstract simplex path subdivisions. Our main application is a short and structural proof of the theorem of Castaneda and Rajsbaum. This theorem in turn implies the solvability of the weak symmetry breaking task in the immediate snapshot wait-free model in the case when the number of processes is not a power of a prime number.

Topik & Kata Kunci

cs.DC math.CO

Penulis (1)

Dmitry N. Kozlov

Format Sitasi

APA MLA BibTeX

Kozlov, D.N. (2013). Weak symmetry breaking and abstract simplex paths. https://arxiv.org/abs/1311.7289

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓