Classifying rendezvous tasks of arbitrary dimension
From MaRDI portal
Publication:1019731
DOI10.1016/j.tcs.2009.01.033zbMath1166.68006MaRDI QIDQ1019731
Pan, Jian Zhong, Xingwu Liu, Zhiwei Xu
Publication date: 28 May 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.033
68M14: Distributed systems
Related Items
Power and limits of distributed computing shared memory models, Locality and checkability in wait-free computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to meet in anonymous network
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- A classification of wait-free loop agreement tasks
- Asynchronous deterministic rendezvous in graphs
- Tight bounds for k -set agreement
- The topological structure of asynchronous computability
- Impossibility of distributed consensus with one faulty process
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Wait-free k-set agreement is impossible
- Towards a topological characterization of asynchronous complexity
- Introduction to homotopy theory