scientific article; zbMATH DE number 6400736

Sergio Rajsbaum, Dmitry N. Kozlov, Maurice P. Herlihy

Publication date: 11 February 2015

Full work available at URL: http://www.sciencedirect.com/science/book/9780124045781

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

simplicial complexes distributed computing simplicial maps combinatorial topology distributed protocol asynchronous distributed computation wait-free protocol solvability of distributed algorithms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Distributed systems (68M14) Simplicial sets and complexes in algebraic topology (55U10) Network protocols (68M12) Distributed algorithms (68W15) Combinatorial aspects of simplicial complexes (05E45)

Related Items (43)

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 ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement ⋮ Communication Complexity of Wait-Free Computability in Dynamic Networks ⋮ Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems ⋮ Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ Tasks in modular proofs of concurrent algorithms ⋮ Iterated chromatic subdivisions are collapsible ⋮ 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 ⋮ Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes ⋮ Topology of the immediate snapshot complexes ⋮ A Sound Foundation for the Topological Approach to Task Solvability ⋮ Byzantine-tolerant causal broadcast ⋮ Bounds on the Step and Namespace Complexity of Renaming ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ What Can be Computed in a Distributed System? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ All binomial identities are orderable ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ THE MCKINSEY–TARSKI THEOREM FOR LOCALLY COMPACT ORDERED SPACES ⋮ Wait-free solvability of colorless tasks in anonymous shared-memory model ⋮ A necessary condition for Byzantine \(k\)-set agreement ⋮ 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 ⋮ Wait-free approximate agreement on graphs ⋮ A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring ⋮ Asynchronous Coordination Under Preferences and Constraints ⋮ t-Resilient Immediate Snapshot Is Impossible ⋮ Back to the Coordinated Attack Problem ⋮ Connectivity of spaces of directed paths in geometric models for concurrent computation ⋮ Topological model of neural information networks

This page was built for publication: