The following pages link to (Q5498755):
Displaying 45 items.
- Topology of the immediate snapshot complexes (Q471457) (← links)
- All binomial identities are orderable (Q730270) (← links)
- A necessary condition for Byzantine \(k\)-set agreement (Q738885) (← links)
- Iterated chromatic subdivisions are collapsible (Q891921) (← links)
- Collapsibility of read/write models using discrete Morse theory (Q1616395) (← links)
- An algorithmic approach to the asynchronous computability theorem (Q1616400) (← links)
- The entropy of a distributed computation random number generation from memory interleaving (Q1656885) (← links)
- Geometric and combinatorial views on asynchronous computability (Q1657197) (← links)
- Structure theory of flip graphs with applications to weak symmetry breaking (Q1659336) (← links)
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems (Q1686116) (← links)
- Byzantine-tolerant causal broadcast (Q1981768) (← links)
- The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
- Connectivity of spaces of directed paths in geometric models for concurrent computation (Q2096387) (← links)
- Topological model of neural information networks (Q2117913) (← links)
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring (Q2304020) (← links)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
- Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- t-Resilient Immediate Snapshot Is Impossible (Q2835025) (← links)
- (Q4560213) (← links)
- Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes (Q4608477) (← links)
- Bounds on the Step and Namespace Complexity of Renaming (Q4646446) (← links)
- THE MCKINSEY–TARSKI THEOREM FOR LOCALLY COMPACT ORDERED SPACES (Q4959665) (← links)
- Back to the Coordinated Attack Problem (Q5006457) (← links)
- (Q5091100) (← links)
- (Q5091106) (← links)
- Communication Complexity of Wait-Free Computability in Dynamic Networks (Q5100966) (← links)
- What Can be Computed in a Distributed System? (Q5170751) (← links)
- Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
- A Sound Foundation for the Topological Approach to Task Solvability (Q5875396) (← links)
- Wait-free approximate agreement on graphs (Q5918635) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5918638) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← links)
- Wait-free solvability of colorless tasks in anonymous shared-memory model (Q5920219) (← links)
- Wait-free approximate agreement on graphs (Q5925616) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6044466) (← links)
- The solvability of consensus in iterated models extended with safe-consensus (Q6056624) (← links)
- Impure Simplicial Complexes: Complete Axiomatization (Q6076177) (← links)
- Stirling complexes (Q6102902) (← links)
- Communication pattern models: an extension of action models for dynamic-network distributed systems (Q6642582) (← links)
- The topology of randomized symmetry-breaking distributed computing (Q6645915) (← links)
- Pseudospheres: combinatorics, topology and distributed systems (Q6645918) (← links)
