Pages that link to "Item:Q719296"
From MaRDI portal
The following pages link to Self-stabilizing leader election in optimal space under an arbitrary scheduler (Q719296):
Displaying 13 items.
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Self-stabilizing silent disjunction in an anonymous network (Q507596) (← links)
- Self-stabilizing leader election in polynomial steps (Q528197) (← links)
- An \(O(n)\)-time self-stabilizing leader election algorithm (Q645826) (← 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)
- 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)
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives (Q2428653) (← links)
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler (Q4639900) (← links)
- Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples (Q5207907) (← links)
