Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1306903 (Why is no real title available?)
- scientific article; zbMATH DE number 1332668 (Why is no real title available?)
- scientific article; zbMATH DE number 2061546 (Why is no real title available?)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A result in order statistics related to probabilistic counting
- Accessing nearby copies of replicated objects in a distributed environment
- Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
- Distributed Computing
- Fault-containing self-stabilizing algorithms
- Local stabilizer
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Resource bounds for self stabilizing message driven protocols
- Self-Stabilization by Counter Flushing
- Self-stabilization
- Self-stabilization by window washing
- Self-stabilizing extensions for message-passing systems
- Self-stabilizing systems in spite of distributed control
- The geometry of graphs and some of its algorithmic applications
- Time, clocks, and the ordering of events in a distributed system
- What cannot be computed locally!
- \(\mathrm{GS}^{3}\): scalable self-configuration and self-healing in wireless networks
- \textsc{Maximal Independent Sets} in radio networks
Cited in
(11)- Oblivious routing for sensor network topologies
- Spanders: distributed spanning expanders
- The expressive power of snap-stabilization
- Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Robust self-stabilizing weight-based clustering algorithm
- A deterministic worst-case message complexity optimal solution for resource discovery
- Stabilizing data-link over non-FIFO channels with optimal fault-resilience
- Practically stabilizing SWMR atomic memory in message-passing systems
- Partially ordered knowledge sharing and fractionated systems in the context of other models for distributed computing
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
This page was built for publication: Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004316)