Resource Bounds for Self-Stabilizing Message-Driven Protocols
From MaRDI portal
Publication:4337445
Recommendations
Cited in
(17)- SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
- Computational tradeoffs in biological neural networks: self-stabilizing winner-take-all networks
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
- Self-stabilization with path algebra
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Resource efficient stabilization for local tasks despite unknown capacity links
- On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection
- Stabilizing data-link over non-FIFO channels with optimal fault-resilience
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- When consensus meets self-stabilization
- Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
- Universal dynamic synchronous self-stabilization
- Randomization adaptive self-stabilization
- Finite-state self-stabilizing protocols in message-passing systems
- Reducing the number of messages in self-stabilizing protocols
- Practically stabilizing SWMR atomic memory in message-passing systems
- Self-stabilizing systems in spite of high dynamics
This page was built for publication: Resource Bounds for Self-Stabilizing Message-Driven Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337445)