Homotopy theory and distributed computing
From MaRDI portal
Cites work
- $p$-primary components of homotopy groups III. Stable groups of the sphere
- A classification of wait-free loop agreement tasks
- Algebraic topology and distributed computing
- Classifying rendezvous tasks of arbitrary dimension
- Compositional Methods in Homotopy Groups of Spheres. (AM-49)
- scientific article; zbMATH DE number 3984103 (Why is no real title available?)
- scientific article; zbMATH DE number 1559574 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3371259 (Why is no real title available?)
- Introduction to homotopy theory
- Introduction to homotopy theory
- On the Homotopy Groups of the Union of Spheres
- Stable homotopy groups of spheres: from dimension 0 to 90
- The asynchronous computability theorem for t-resilient tasks
- The evolution of non-degenerate and degenerate rendezvous tasks
- The triviality of the 61-stem in the stable homotopy groups of spheres
This page was built for publication: Homotopy theory and distributed computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391351)