An equivariance theorem with applications to renaming

DOI10.1007/S00453-013-9855-3zbMATH Open1314.68057OpenAlexW2157325951MaRDI QIDQ486986FDOQ486986

Authors: Armando Castañeda, Sergio Rajsbaum, Maurice 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

Recommendations

• An equivariance theorem with applications to renaming
• New combinatorial topology upper and lower bounds for renaming
• New combinatorial topology bounds for renaming: the upper bound
• Renaming in an asynchronous environment
• New combinatorial topology bounds for renaming: the lower bound

zbMATH Keywords

distributed computinglower boundalgebraic topologyrenaming

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Transformation groups
• Renaming in an asynchronous environment
• The topological structure of asynchronous computability
• Unifying synchronous and asynchronous message-passing models
• Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
• Algebraic spans
• The topology of shared-memory adversaries
• The Combinatorial Structure of Wait-Free Solvable Tasks
• Counting-based impossibility proofs for renaming and set agreement
• The extended BG-simulation and the characterization of t-resiliency
• New combinatorial topology bounds for renaming: the lower bound
• New combinatorial topology bounds for renaming

Cited In (4)

• Bounds on the Step and Namespace Complexity of Renaming
• New combinatorial topology upper and lower bounds for renaming
• Permutative renamings in the extended Fraenkel-Mostowski set theory
• An equivariance theorem with applications to renaming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486986)