The following pages link to Distributed reset (Q4419757):
Displaying 15 items.
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← links)
- On termination detection in crash-prone distributed systems with failure detectors (Q436803) (← links)
- Assurance of dynamic adaptation in distributed systems (Q436856) (← links)
- Self-stabilizing silent disjunction in an anonymous network (Q507596) (← links)
- Self-stabilizing leader election in polynomial steps (Q528197) (← links)
- Separation of circulating tokens (Q555311) (← links)
- An \(O(n)\)-time self-stabilizing leader election algorithm (Q645826) (← links)
- Adaptive broadcast by fault-tolerant spanning tree switching (Q666207) (← links)
- Self-stabilizing leader election in optimal space under an arbitrary scheduler (Q719296) (← links)
- Self-stabilizing leader election in dynamic networks (Q722199) (← links)
- The TTA's approach to resilience after transient upsets (Q853613) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← links)
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811) (← links)
- Stabilizing maximum matching in bipartite networks (Q1014349) (← links)
- Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative (Q1741967) (← links)
