Algebraic spans
From MaRDI portal
Publication:4507893
DOI10.1017/S0960129500003170zbMath0956.68098MaRDI 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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
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, Narrowing Power vs. Efficiency in Synchronous Set Agreement, A topological perspective on distributed network algorithms, The topology of distributed adversaries, A non-topological proof for the impossibility of \(k\)-set agreement, The renaming problem in shared memory systems: an introduction, An equivariance theorem with applications to renaming, New combinatorial topology bounds for renaming: the lower bound, From adaptive renaming to set agreement, Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound, Renaming and the weakest family of failure detectors, Tight bounds for \(k\)-set agreement with limited-scope failure detectors, An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems, An Equivariance Theorem with Applications to Renaming
