Pages that link to "Item:Q645826"
From MaRDI portal
The following pages link to An \(O(n)\)-time self-stabilizing leader election algorithm (Q645826):
Displaying 12 items.
- Competitive self-stabilizing \(k\)-clustering (Q264580) (← links)
- Self-stabilizing silent disjunction in an anonymous network (Q507596) (← links)
- Self-stabilizing leader election in polynomial steps (Q528197) (← links)
- A self-stabilizing \(k\)-clustering algorithm for weighted graphs (Q666253) (← links)
- Self-stabilizing leader election in dynamic networks (Q722199) (← links)
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← links)
- Optimized silent self-stabilizing scheme for tree-based constructions (Q2072099) (← links)
- Near-optimal knowledge-free resilient leader election (Q2097737) (← links)
- The first fully polynomial stabilizing algorithm for BFS tree construction (Q2272977) (← links)
- Maintaining balanced trees for structured distributed streaming systems (Q2410236) (← links)
- Self-stabilizing 2-minimal dominating set algorithms based on loop composition (Q6144026) (← links)
- Self-stabilizing synchronous unison in directed networks (Q6499546) (← links)
