Pages that link to "Item:Q528197"
From MaRDI portal
The following pages link to Self-stabilizing leader election in polynomial steps (Q528197):
Displaying 12 items.
- Self-stabilizing silent disjunction in an anonymous network (Q507596) (← links)
- An \(O(n)\)-time self-stabilizing leader election algorithm (Q645826) (← links)
- Self-stabilizing leader election in optimal space under an arbitrary scheduler (Q719296) (← 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)
- Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative (Q1741967) (← links)
- Memory requirements for silent stabilization (Q1818300) (← 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)
- (Q5091108) (← links)
- Self-stabilizing systems in spite of high dynamics (Q6104354) (← links)