scientific article; zbMATH DE number 7281366

zbMath1448.68105MaRDI QIDQ5137896

John W. Havlicek

Publication date: 3 December 2020

Full work available at URL: https://link.springer.com/article/10.1007/s004460050068

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

zbMATH Keywords

simplicial complexeshomologywait-free computingdecision tasks

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (4)

Collapsibility of read/write models using discrete Morse theory ⋮ Unnamed Item ⋮ Hundreds of impossibility results for distributed computing ⋮ A simplicial complex model for dynamic epistemic logic to study distributed task computability

This page was built for publication: