Time optimal self-stabilizing synchronization
From MaRDI portal
Cited in
(27)- Stabilizing time-adaptive protocols
- The local detection paradigm and its applications to self-stabilization
- On the computational power of self-stabilizing systems
- Snap-stabilization and PIF in tree networks
- Parallel composition for time-to-fault adaptive stabilization
- Fault-containing self-stabilizing distributed protocols
- Near-optimal knowledge-free resilient leader election
- The first fully polynomial stabilizing algorithm for BFS tree construction
- Proof labeling schemes
- Maintaining balanced trees for structured distributed streaming systems
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
- The expressive power of snap-stabilization
- Self-stabilizing Byzantine asynchronous unison
- Self-stabilizing silent disjunction in an anonymous network
- Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
- Self-stabilizing leader election in polynomial steps
- A uniform self-stabilizing minimum diameter spanning tree algorithm
- Self-stabilization of wait-free shared memory objects
- An O(n)-time self-stabilizing leader election algorithm
- Self-stabilizing synchronous unison in directed networks
- Communication efficient self-stabilizing leader election
- Reducing the number of messages in self-stabilizing protocols
- Luby's MIS algorithms made self-stabilizing
- Asynchronous self-stabilization made fast, simple, and energy-efficient
- Self-stabilizing leader election in optimal space under an arbitrary scheduler
- Self-stabilizing leader election in dynamic networks
- Being efficient in time, space, and workload: a self-stabilizing unison and its consequences
This page was built for publication: Time optimal self-stabilizing synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248536)
