New combinatorial topology bounds for renaming: the lower bound
type: Item
instance of: scholarly article
title: New combinatorial topology bounds for renaming: the lower bound
zbMATH Open document ID: 1231.68068
author: Armando Castañeda
author: Sergio Rajsbaum
published in: Distributed Computing
publication date: 2010-09-09T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5781469
zbMATH Keywords: shared-memory
zbMATH Keywords: renaming
zbMATH Keywords: lower bound
zbMATH Keywords: combinatorial topology
MaRDI profile type: Publication
full work available at URL: s00446-010-0108-2
OpenAlex ID: W2030003887
cites work: The Combinatorial Structure of Wait-Free Solvable Tasks
cites work: Sharing memory robustly in message-passing systems
cites work: Renaming in an asynchronous environment
cites work: Q4398822
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: Immediate atomic snapshots and fast renaming
cites work: A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
cites work: New combinatorial topology upper and lower bounds for renaming
cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
cites work: Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
cites work: The extended BG-simulation and the characterization of t-resiliency
cites work: From adaptive renaming to set agreement
cites work: Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
cites work: Distributed Computing
cites work: Three-Processor Tasks Are Undecidable
cites work: A topological treatment of early-deciding set-agreement
cites work: A Note on the Homotopy Type of Wait-Free Atomic Snapshot Protocol Complexes
cites work: Q4871630
cites work: A classification of wait-free loop agreement tasks
cites work: Algebraic spans
cites work: The topological structure of asynchronous computability
cites work: Q4527026
cites work: The asynchronous computability theorem for t-resilient tasks
cites work: Toward a Topological Characterization of Asynchronous Complexity
cites work: Q4437114
cites work: Q4881606
cites work: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
DOI: 10.1007/S00446-010-0108-2
description: scientific article; zbMATH DE number 5781469