Algebraic spans

DOI10.1017/S0960129500003170zbMath0956.68098OpenAlexW2914571390MaRDI QIDQ4507893

Sergio Rajsbaum, Maurice P. Herlihy

Publication date: 10 October 2000

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129500003170

zbMATH Keywords

distributed computingacyclic carrier theorem

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (15)

An Equivariance Theorem with Applications to Renaming ⋮ The topology of distributed adversaries ⋮ A non-topological proof for the impossibility of \(k\)-set agreement ⋮ Renaming and the weakest family of failure detectors ⋮ Tight bounds for \(k\)-set agreement with limited-scope failure detectors ⋮ The renaming problem in shared memory systems: an introduction ⋮ An equivariance theorem with applications to renaming ⋮ Bounds on the Step and Namespace Complexity of Renaming ⋮ An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing ⋮ New combinatorial topology bounds for renaming: the lower bound ⋮ Narrowing Power vs. Efficiency in Synchronous Set Agreement ⋮ From adaptive renaming to set agreement ⋮ An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems ⋮ A topological perspective on distributed network algorithms ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound

This page was built for publication: Algebraic spans