An equivariance theorem with applications to renaming

DOI10.1007/s00453-013-9855-3zbMath1314.68057OpenAlexW2157325951MaRDI QIDQ486986

Armando Castañeda, Sergio Rajsbaum, Maurice P. Herlihy

Publication date: 19 January 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00586190/file/PI-1975.pdf

zbMATH Keywords

algebraic topologylower bounddistributed computingrenaming

Mathematics Subject Classification ID

Distributed systems (68M14) Simplicial sets and complexes in algebraic topology (55U10)

Related Items (1)

Bounds on the Step and Namespace Complexity of Renaming

Cites Work

• Unnamed Item
• New combinatorial topology bounds for renaming: the lower bound
• Transformation groups
• Unifying synchronous and asynchronous message-passing models
• The Combinatorial Structure of Wait-Free Solvable Tasks
• The topological structure of asynchronous computability
• Renaming in an asynchronous environment
• Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
• Algebraic spans
• Counting-Based Impossibility Proofs for Renaming and Set Agreement
• The extended BG-simulation and the characterization of t-resiliency
• The topology of shared-memory adversaries
• New combinatorial topology bounds for renaming

This page was built for publication: An equivariance theorem with applications to renaming