Introduction to Distributed Self-Stabilizing Algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 732976
- scientific article; zbMATH DE number 512850
- Distributed algorithms. An intuitive approach
- Distributed systems. An algorithmic approach
- Distributed Systems
- Binary self-stabilization in distributed systems
- Self-stabilizing distributed algorithm for local mutual inclusion
Cited in
(43)- Binary self-stabilization in distributed systems
- Fault-containing self-stabilization using priority scheduling
- Self-stabilization with path algebra
- Self-stabilizing distributed algorithms by gellular automata
- Optimized silent self-stabilizing scheme for tree-based constructions
- Monotonic self-stabilization and its application to robust and adaptive pattern formation
- Computational universality and efficiency in morphogenetic systems
- A visit to mutual exclusion in seven dates
- Certification of an exact worst-case self-stabilization time
- Analysis of a memory-efficient self-stabilizing BFS spanning tree construction
- scientific article; zbMATH DE number 1696676 (Why is no real title available?)
- scientific article; zbMATH DE number 2006654 (Why is no real title available?)
- Daemon Conversions in Distributed Self-stabilizing Algorithms
- Self-stabilizing distributed algorithms by gellular automata
- Self-stabilisation of Cellular Automata on Tilings
- Distributed Computing - IWDC 2003
- Self-stabilization Preserving Compiler
- Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures
- Preface
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
- The canonical amoebot model: algorithms and concurrency control
- Self-stabilizing systems in spite of high dynamics
- Solving simultaneous target assignment and path planning efficiently with time-independent execution
- Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
- Self-stabilizing indulgent zero-degrading binary consensus
- Self-stabilizing synchronous unison in directed networks
- Communication efficient self-stabilizing leader election
- Self-stabilizing ( +1)-coloring in sublinear (in ) rounds via locally-iterative algorithms
- Self-stabilizing multivalued consensus in asynchronous crash-prone systems
- Early adapting to trends: self-stabilizing information spread using passive communication
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Silent anonymous snap-stabilizing termination detection
- Decreasing verification radius in local certification
- Locally-iterative (+1)-coloring in sublinear (in ) rounds
- Asynchronous self-stabilization made fast, simple, and energy-efficient
- On self-stabilizing leader election in directed networks
- Model checking of distributed algorithms using synchronous programs
- Self-stabilizing multivalued consensus in the presence of Byzantine faults and asynchrony
- Scalable self-stabilization
- Self-stabilizing snapshot objects for asynchronous failure-prone networked systems
- Being efficient in time, space, and workload: a self-stabilizing unison and its consequences
- Practically-self-stabilizing vector clocks without scheduling fairness
This page was built for publication: Introduction to Distributed Self-Stabilizing Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377007)
