An Equivariance Theorem with Applications to Renaming
From MaRDI portal
Publication:2894460
DOI10.1007/978-3-642-29344-3_12zbMath1353.68197MaRDI QIDQ2894460
Armando Castañeda, Sergio Rajsbaum, Maurice P. Herlihy
Publication date: 29 June 2012
Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00586190/file/PI-1975.pdf
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
55U10: Simplicial sets and complexes in algebraic topology
Related Items
The solvability of consensus in iterated models extended with safe-consensus, The topology of distributed adversaries
Cites Work
- Unnamed Item
- Transformation groups
- Unifying synchronous and asynchronous message-passing models
- New combinatorial topology upper and lower bounds for renaming
- 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
- The extended BG-simulation and the characterization of t-resiliency
- The topology of shared-memory adversaries