The following pages link to (Q2782251):
Displaying 50 items.
- Competitive self-stabilizing \(k\)-clustering (Q264580) (← links)
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- A leader election algorithm for dynamic networks with causal clocks (Q360270) (← links)
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
- The snap-stabilizing message forwarding algorithm on tree topologies (Q391257) (← links)
- Self-stabilizing labeling and ranking in ordered trees (Q391998) (← links)
- The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
- Spanders: distributed spanning expanders (Q395654) (← links)
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
- Bounds on Herman's algorithm (Q401316) (← links)
- Tiara: a self-stabilizing deterministic skip list and skip graph (Q418743) (← links)
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← links)
- A self-stabilizing algorithm to maximal 2-packing with improved complexity (Q436592) (← links)
- Loosely-stabilizing leader election in a population protocol model (Q442276) (← links)
- Feasibility analysis for robustness quantification by symbolic model checking (Q453480) (← links)
- Self-stabilizing Byzantine asynchronous unison (Q455967) (← links)
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Re-Chord: a self-stabilizing chord overlay network (Q487270) (← links)
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm (Q498668) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
- Self-stabilizing silent disjunction in an anonymous network (Q507596) (← links)
- Self-stabilizing leader election in polynomial steps (Q528197) (← links)
- A self-stabilizing algorithm for edge monitoring in wireless sensor networks (Q528199) (← links)
- Dynamic FTSS in asynchronous systems: the case of unison (Q551164) (← links)
- Automated constraint-based addition of nonmasking and stabilizing fault-tolerance (Q555302) (← links)
- A self-stabilizing transformer for population protocols with covering (Q555304) (← links)
- Consensus when all processes may be Byzantine for some time (Q555306) (← links)
- Separation of circulating tokens (Q555311) (← links)
- Nash equilibria in stabilizing systems (Q555314) (← links)
- Oracle-based flocking of mobile robots in crash-recovery model (Q555317) (← links)
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks (Q555319) (← links)
- Self-stabilizing minimum degree spanning tree within one from the optimal degree (Q635330) (← links)
- An \(O(n)\)-time self-stabilizing leader election algorithm (Q645826) (← links)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- A self-stabilizing \(k\)-clustering algorithm for weighted graphs (Q666253) (← links)
- Snap-stabilization in message-passing systems (Q666259) (← links)
- Randomization adaptive self-stabilization (Q707595) (← links)
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem (Q719294) (← links)
- A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 (Q719295) (← links)
- Self-stabilizing leader election in optimal space under an arbitrary scheduler (Q719296) (← links)
- Secure and self-stabilizing clock synchronization in sensor networks (Q719301) (← links)
- Self-stabilizing leader election in dynamic networks (Q722199) (← links)
- On the expected time for Herman's probabilistic self-stabilizing algorithm (Q817822) (← links)
- Circle formation of weak robots and Lyndon words (Q845920) (← links)
- An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity (Q845956) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks (Q897385) (← links)
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks (Q897391) (← links)
