Distributed computing through combinatorial topology
From MaRDI portal
asynchronous distributed computationcombinatorial topologydistributed computingdistributed protocolsimplicial complexessimplicial mapssolvability of distributed algorithmswait-free protocol
Combinatorial aspects of simplicial complexes (05E45) Simplicial sets and complexes in algebraic topology (55U10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Network protocols (68M12) Distributed systems (68M14) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)
Recommendations
Cited in
(63)- On distributed catenation
- Collapsibility of read/write models using discrete Morse theory
- An algorithmic approach to the asynchronous computability theorem
- The entropy of a distributed computation random number generation from memory interleaving
- Geometric and combinatorial views on asynchronous computability
- Structure theory of flip graphs with applications to weak symmetry breaking
- Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
- Byzantine-tolerant causal broadcast
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Connectivity of spaces of directed paths in geometric models for concurrent computation
- Topological model of neural information networks
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
- An overview of synchronous message-passing and topology
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- Asynchronous coordination under preferences and constraints
- t-resilient immediate snapshot Is impossible
- Simulations and reductions for colorless tasks
- The topological structure of asynchronous computability
- scientific article; zbMATH DE number 5164354 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 1497791 (Why is no real title available?)
- scientific article; zbMATH DE number 6991613 (Why is no real title available?)
- Rendezvous in distributed systems. Theory, algorithms and applications
- Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes
- Bounds on the step and namespace complexity of renaming
- Topology of the immediate snapshot complexes
- The McKinsey-Tarski theorem for locally compact ordered spaces
- Back to the coordinated attack problem
- Task computability in unreliable anonymous networks
- Concurrent specifications beyond linearizability
- Communication Complexity of Wait-Free Computability in Dynamic Networks
- What can be computed in a distributed system?
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
- Untangling partial agreement: iterated \(x\)-consensus simulations
- Efficient, Decentralized Computation of the Topology of Spatial Regions
- Do-all computing in distributed systems.
- Distributed systems. An algorithmic approach
- A Sound Foundation for the Topological Approach to Task Solvability
- Wait-free approximate agreement on graphs
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- A topological perspective on distributed network algorithms
- A topological perspective on distributed network algorithms
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Wait-free approximate agreement on graphs
- A distributed low tree-depth decomposition algorithm for bounded expansion classes
- Synchronous \(t\)-resilient consensus in arbitrary graphs
- Tasks in modular proofs of concurrent algorithms
- The solvability of consensus in iterated models extended with safe-consensus
- Impure Simplicial Complexes: Complete Axiomatization
- Stirling complexes
- Modal and justification logics for multi-agent systems (invited talk)
- About informatics, distributed computing, and our job: a personal view
- Communication pattern models: an extension of action models for dynamic-network distributed systems
- The topology of randomized symmetry-breaking distributed computing
- Pseudospheres: combinatorics, topology and distributed systems
- On two- and three-valued semantics for impure simplicial complexes
- The topological mu-calculus: completeness and decidability
- All binomial identities are orderable
- The complexity of full-information iterated protocols
- A necessary condition for Byzantine \(k\)-set agreement
- Iterated chromatic subdivisions are collapsible
This page was built for publication: Distributed computing through combinatorial topology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5498755)
