The following pages link to Algebraic spans (Q4507893):
Displaying 17 items.
- The topology of distributed adversaries (Q360277) (← links)
- A non-topological proof for the impossibility of \(k\)-set agreement (Q391997) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- An equivariance theorem with applications to renaming (Q486986) (← links)
- New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- Tight bounds for \(k\)-set agreement with limited-scope failure detectors (Q1953644) (← links)
- An axiomatic approach to computing the connectivity of synchronous and asynchronous systems (Q2810958) (← links)
- An Equivariance Theorem with Applications to Renaming (Q2894460) (← links)
- Bounds on the Step and Namespace Complexity of Renaming (Q4646446) (← links)
- An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing (Q5179018) (← links)
- Narrowing Power vs. Efficiency in Synchronous Set Agreement (Q5445741) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← links)
- Defining logical obstruction with fixpoints in epistemic logic (Q6645916) (← links)
- Pseudospheres: combinatorics, topology and distributed systems (Q6645918) (← links)
