Resource efficient stabilization for local tasks despite unknown capacity links
From MaRDI portal
Cites work
- A fast parallel algorithm for the maximal independent set problem
- A self-stabilizing algorithm for coloring bipartite graphs
- A self-stabilizing algorithm for coloring planar graphs
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Algorithmic Aspects of Wireless Sensor Networks
- An Improved Distributed Algorithm for Maximal Independent Set
- Compact self-stabilizing leader election for general networks
- Deterministic (+1)-coloring in sublinear (in ) time in static, dynamic, and faulty networks
- scientific article; zbMATH DE number 1332672 (Why is no real title available?)
- Legal coloring of graphs
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
- Locality in Distributed Graph Algorithms
- Locally-iterative Distributed (Δ + 1)-coloring and Applications
- Resource Bounds for Self-Stabilizing Message-Driven Protocols
- Self-stabilization
- Self-Stabilization by Counter Flushing
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-stabilization over unreliable communication media
- Self-stabilization with \(r\)-operators
- Self-stabilization with path algebra
- Self-stabilizing extensions for message-passing systems
- Self-stabilizing systems in spite of distributed control
- Stabilization and pseudo-stabilization
- Stabilizing data-link over non-FIFO channels with optimal fault-resilience
- The fault span of crash failures
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- Tolerating transient and intermittent failures
This page was built for publication: Resource efficient stabilization for local tasks despite unknown capacity links
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612539)
