How to improve snap-stabilizing point-to-point communication space complexity?
From MaRDI portal
Recommendations
Cites work
- A self-stabilizing algorithm for constructing breadth-first trees
- Deadlock-Free Packet Switching Networks
- Distributed computation on graphs
- How to improve snap-stabilizing point-to-point communication space complexity?
- scientific article; zbMATH DE number 2061548 (Why is no real title available?)
- Introduction to algorithms
- Introduction to Distributed Algorithms
- Optimal fully adaptive minimal wormhole routing for meshes
- Parallel Processing and Applied Mathematics
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Self-stabilizing systems in spite of distributed control
- Snap-stabilization and PIF in tree networks
- Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks
Cited in
(4)
This page was built for publication: How to improve snap-stabilizing point-to-point communication space complexity?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555308)