Classifying rendezvous tasks of arbitrary dimension
From MaRDI portal
Recommendations
- The evolution of non-degenerate and degenerate rendezvous tasks
- A classification of wait-free loop agreement tasks
- Brief announcement: There are plenty of tasks weaker than perfect renaming and stronger than set agreement
- The topological structure of asynchronous computability
- scientific article; zbMATH DE number 1559574
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1559574 (Why is no real title available?)
- A classification of wait-free loop agreement tasks
- Asynchronous deterministic rendezvous in graphs
- Generalized FLP impossibility result for t-resilient asynchronous computations
- How to meet in anonymous network
- Impossibility of distributed consensus with one faulty process
- Introduction to homotopy theory
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- The topological structure of asynchronous computability
- Tight bounds for \(k\)-set agreement
- Tight bounds for asynchronous randomized consensus
- Towards a topological characterization of asynchronous complexity
- Wait-free k-set agreement is impossible
Cited in
(8)- Power and limits of distributed computing shared memory models
- The relative power of composite loop agreement tasks
- A classification of wait-free loop agreement tasks
- Locality and checkability in wait-free computing
- Algebraic topology and distributed computing
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
- The multiway rendezvous
- The evolution of non-degenerate and degenerate rendezvous tasks
This page was built for publication: Classifying rendezvous tasks of arbitrary dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019731)
