Lélia Blin

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 22

Top Topics

Minimum Total Cost

Memory Efficient

Top Venues

Theor. Comput. Sci.

Publications

Lélia Blin, Gabriel Le Bouder, Franck Petit
Optimal Memory Requirement for Self-stabilizing Token Circulation. SIROCCO (2024)
Lélia Blin, Anaïs Durand, Sébastien Tixeuil
Resource efficient stabilization for local tasks despite unknown capacity links. Theor. Comput. Sci. 1013 (2024)
Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. 25 (2023)
Lélia Blin, Colette Johnen, Gabriel Le Bouder, Franck Petit
Silent Anonymous Snap-Stabilizing Termination Detection. SRDS (2022)
Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. OPODIS (2021)
Lélia Blin, Sébastien Tixeuil
Compact self-stabilizing leader election for general networks. J. Parallel Distributed Comput. 144 (2020)
Lélia Blin, Anaïs Durand, Sébastien Tixeuil
Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links. CoRR (2020)
Lélia Blin, Swan Dubois, Laurent Feuilloley
Silent MST Approximation for Tiny Memory. SSS (2020)
Lélia Blin, Swan Dubois, Laurent Feuilloley
Silent MST approximation for tiny memory. CoRR (2019)
Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
Memory Lower Bounds for Self-Stabilization. CoRR (2019)
Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
Brief Announcement: Memory Lower Bounds for Self-Stabilization. DISC (2019)
Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil
On asynchronous rendezvous in general graphs. Theor. Comput. Sci. 753 (2019)
Lélia Blin, Fadwa Boubekeur, Swan Dubois
A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. J. Parallel Distributed Comput. 117 (2018)
Lélia Blin, Sébastien Tixeuil
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distributed Comput. 31 (2) (2018)
Lélia Blin, Sébastien Tixeuil
Compact Self-Stabilizing Leader Election for General Networks. LATIN (2018)
Lélia Blin, Sébastien Tixeuil
Compact Self-Stabilizing Leader Election for Arbitrary Networks. CoRR (2017)
Lélia Blin, Sébastien Tixeuil
Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs. DISC (2017)
Lélia Blin, Janna Burman, Nicolas Nisse
Exclusive Graph Searching. Algorithmica 77 (3) (2017)
Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property. Comput. J. 59 (2) (2016)
Fadwa Boubekeur, Lélia Blin, Rémy Léone, Paolo Medagliani
Bounding Degrees on RPL. Q2SWinet@MSWiM (2015)
Lélia Blin, Pierre Fraigniaud
Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees. ICDCS (2015)
Lélia Blin, Fadwa Boubekeur, Swan Dubois
A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon. IPDPS (2015)
Lélia Blin, Pierre Fraigniaud, Boaz Patt-Shamir
On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms. SSS (2014)
Lélia Blin, Pierre Fraigniaud
Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes. DISC (2014)
Lélia Blin, Sébastien Tixeuil
Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative. CoRR (2014)
Lélia Blin, Pierre Fraigniaud
Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction. CoRR (2014)
Lélia Blin, Sébastien Tixeuil
Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative. DISC (2013)
Lélia Blin
Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes. CoRR (2013)
Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis
)log(n)-approximation algorithm for dynamic Steiner trees. Theor. Comput. Sci. 500 (2013)
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. CoRR (2013)
Lélia Blin, Sébastien Tixeuil
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits. PODC (2013)
Lélia Blin, Janna Burman, Nicolas Nisse
Exclusive Graph Searching. ESA (2013)
Lélia Blin, Janna Burman, Nicolas Nisse
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching. DISC (2012)
Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
Self-stabilizing minimum degree spanning tree within one from the optimal degree. J. Parallel Distributed Comput. 71 (3) (2011)
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)
Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault
Hardness Results and Heuristic for Multi-groups Interconnection. Comput. J. 53 (9) (2010)
Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil
Loop-Free Super-Stabilizing Spanning Tree Construction. SSS (2010)
Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis
Fast Self-Stabilizing Minimum Spanning Tree Construction CoRR (2010)
Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil
Universal Loop-Free Super-Stabilization CoRR (2010)
Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil
Exclusive Perpetual Ring Exploration without Chirality. DISC (2010)
Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
Self-stabilizing minimum-degree spanning tree within one from the optimal degree. IPDPS (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 (2009)
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)
Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
)-Approximation Algorithm for Dynamic Steiner Trees. SSS (2009)
Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees CoRR (2009)
Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
Distributed chasing of network intruders. Theor. Comput. Sci. 399 (1-2) (2008)
Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
On the Self-stabilization of Mobile Robots in Graphs. OPODIS (2007)
Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
On the Self-stabilization of Mobile Robots in Graphs CoRR (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) (2006)
Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
Distributed Chasing of Network Intruders. SIROCCO (2006)
Fabien Baille, Lélia Blin, Christian Laforest
Distributed Approximation Allocation Resources Algorithm for Connecting Groups. Euro-Par (2006)
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) (2004)
Lélia Blin, Franck Butelle
The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. IPDPS (2003)
Lélia Blin, Alain Cournier, Vincent Villain
An Improved Snap-Stabilizing PIF Algorithm. Self-Stabilizing Systems (2003)
Lélia Blin, Franck Butelle
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. OPODIS (2001)