Lélia Blin

Lélia Blin, Janna Burman, Nicolas Nisse: Brief Announcement: Distributed Exclusive and Perpetual Tree Searching. DISC 2012: 403-404

Lélia Blin, Yann Busnel (Eds.): 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, TADDS '12, Roma, Italy, December 17, 2012. ACM 2012, isbn 978-1-4503-1849-5

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis: Self-stabilizing minimum degree spanning tree within one from the optimal degree. J. Parallel Distrib. Comput. 71(3): 438-449 (2011)

Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault: Hardness Results and Heuristic for Multi-groups Interconnection. Comput. J. 53(9): 1497-1507 (2010)

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil: Loop-Free Super-Stabilizing Spanning Tree Construction. SSS 2010: 50-64

Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil: Exclusive Perpetual Ring Exploration without Chirality. DISC 2010: 312-327

Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis: Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme. DISC 2010: 480-494

Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil: Universal Loop-Free Super-Stabilization. CoRR abs/1006.3009 (2010)

Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis: Fast Self-Stabilizing Minimum Spanning Tree Construction. CoRR abs/1006.3141 (2010)

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis: Self-stabilizing minimum-degree spanning tree within one from the optimal degree. IPDPS 2009: 1-11

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis: A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees. SSS 2009: 133-148

Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil: A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. DISC 2009: 407-422

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis: A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees. CoRR abs/0902.3528 (2009)

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil: A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property. CoRR abs/0905.2287 (2009)

Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial: Distributed chasing of network intruders. Theor. Comput. Sci. 399(1-2): 12-37 (2008)

Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil: On the Self-stabilization of Mobile Robots in Graphs. OPODIS 2007: 301-314

Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil: On the Self-stabilization of Mobile Robots in Graphs. CoRR abs/0708.0909 (2007)

Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès: Fair cost-sharing methods for the minimum spanning tree game. Inf. Process. Lett. 100(1): 29-35 (2006)

Fabien Baille, Lélia Blin, Christian Laforest: Distributed Approximation Allocation Resources Algorithm for Connecting Groups. Euro-Par 2006: 519-529

Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial: Distributed Chasing of Network Intruders. SIROCCO 2006: 70-84

Lélia Blin, Franck Butelle: The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs. Int. J. Found. Comput. Sci. 15(3): 507-516 (2004)

Lélia Blin, Franck Butelle: The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. IPDPS 2003: 161

Lélia Blin, Alain Cournier, Vincent Villain: An Improved Snap-Stabilizing PIF Algorithm. Self-Stabilizing Systems 2003: 199-214

Lélia Blin, Franck Butelle: A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. OPODIS 2001: 113-124