About the Termination Detection in the Asynchronous Message Passing Model
From MaRDI portal
Publication:5448773
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(13)- Synchronized Distributed Termination
- scientific article; zbMATH DE number 4056994 (Why is no real title available?)
- On mobile agent verifiable problems
- scientific article; zbMATH DE number 2013829 (Why is no real title available?)
- Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
- Deducible and equivalent structural knowledges in distributed algorithms
- scientific article; zbMATH DE number 3938558 (Why is no real title available?)
- scientific article; zbMATH DE number 3940743 (Why is no real title available?)
- Local Terminations and Distributed Computability in Anonymous Networks
- Ring based termination detection algorithm for distributed computations
- scientific article; zbMATH DE number 3999307 (Why is no real title available?)
- scientific article; zbMATH DE number 4001466 (Why is no real title available?)
- scientific article; zbMATH DE number 7407798 (Why is no real title available?)
This page was built for publication: About the Termination Detection in the Asynchronous Message Passing Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448773)