The following pages link to Lélia Blin (Q388461):
Displayed 17 items.
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
- Exclusive graph searching (Q521823) (← links)
- Self-stabilizing minimum degree spanning tree within one from the optimal degree (Q635330) (← links)
- Fair cost-sharing methods for the minimum spanning tree game (Q845820) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative (Q1741967) (← links)
- Compact self-stabilizing leader election for general networks (Q2294688) (← links)
- Exclusive Graph Searching (Q2849309) (← links)
- THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS (Q3022016) (← links)
- Exclusive Perpetual Ring Exploration without Chirality (Q3588311) (← links)
- Fast Self-stabilizing Minimum Spanning Tree Construction (Q3588324) (← links)
- Distributed Chasing of Network Intruders (Q3613645) (← links)
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property (Q3646240) (← links)
- (Q4457232) (← links)
- (Q6128591) (← links)
- Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms (Q6131780) (← links)