New combinatorial topology bounds for renaming
From MaRDI portal
Publication:5395676
DOI10.1145/2108242.2108245zbMath1281.68159OpenAlexW2024581561MaRDI QIDQ5395676
Armando Castañeda, Sergio Rajsbaum
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2108242.2108245
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Network protocols (68M12)
Related Items (15)
A visit to mutual exclusion in seven dates ⋮ Tight Bounds for Asynchronous Renaming ⋮ Structure theory of flip graphs with applications to weak symmetry breaking ⋮ Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ Iterated chromatic subdivisions are collapsible ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Renaming and the weakest family of failure detectors ⋮ Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes ⋮ Linear space bootstrap communication schemes ⋮ An equivariance theorem with applications to renaming ⋮ Bounds on the Step and Namespace Complexity of Renaming ⋮ What Can be Computed in a Distributed System? ⋮ All binomial identities are orderable ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ A topological perspective on distributed network algorithms
This page was built for publication: New combinatorial topology bounds for renaming
