Lélia Blin

According to our database, Lélia Blin authored at least 43 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Resource efficient stabilization for local tasks despite unknown capacity links.

Lélia Blin, Anaïs Durand, Sébastien Tixeuil

Theor. Comput. Sci., 2024

Optimal Memory Requirement for Self-stabilizing Token Circulation.

Lélia Blin, Gabriel Le Bouder, Franck Petit

Proceedings of the Structural Information and Communication Complexity, 2024

2023

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms.

Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder

Discret. Math. Theor. Comput. Sci., 2023

2022

Silent Anonymous Snap-Stabilizing Termination Detection.

Lélia Blin, Colette Johnen, Gabriel Le Bouder, Franck Petit

Proceedings of the 41st International Symposium on Reliable Distributed Systems, 2022

2020

Compact self-stabilizing leader election for general networks.

Lélia Blin, Sébastien Tixeuil

J. Parallel Distributed Comput., 2020

Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links.

Lélia Blin, Anaïs Durand, Sébastien Tixeuil

CoRR, 2020

Silent MST Approximation for Tiny Memory.

Lélia Blin, Swan Dubois, Laurent Feuilloley

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

2019

On asynchronous rendezvous in general graphs.

Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil

Theor. Comput. Sci., 2019

Memory Lower Bounds for Self-Stabilization.

Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder

CoRR, 2019

Brief Announcement: Memory Lower Bounds for Self-Stabilization.

Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

2018

A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon.

Lélia Blin, Fadwa Boubekeur, Swan Dubois

J. Parallel Distributed Comput., 2018

Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative.

Lélia Blin, Sébastien Tixeuil

Distributed Comput., 2018

2017

Compact Self-Stabilizing Leader Election for Arbitrary Networks.

Lélia Blin, Sébastien Tixeuil

CoRR, 2017

Exclusive Graph Searching.

Lélia Blin, Janna Burman, Nicolas Nisse

Algorithmica, 2017

Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs.

Lélia Blin, Sébastien Tixeuil

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property.

Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil

Comput. J., 2016

2015

Bounding Degrees on RPL.

Fadwa Boubekeur, Lélia Blin, Rémy Léone, Paolo Medagliani

Proceedings of the 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks, 2015

Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees.

Lélia Blin, Pierre Fraigniaud

Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014

Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction.

Lélia Blin, Pierre Fraigniaud

CoRR, 2014

Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes.

Lélia Blin, Pierre Fraigniaud

Proceedings of the Distributed Computing - 28th International Symposium, 2014

On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms.

Lélia Blin, Pierre Fraigniaud, Boaz Patt-Shamir

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

2013

A super-stabilizing log(<i>n</i>)log(n)-approximation algorithm for dynamic Steiner trees.

Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis

Theor. Comput. Sci., 2013

Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes.

Lélia Blin

CoRR, 2013

Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative.

Lélia Blin, Sébastien Tixeuil

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits.

Lélia Blin, Sébastien Tixeuil

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.

Lélia Blin, Janna Burman, Nicolas Nisse

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011

Self-stabilizing minimum degree spanning tree within one from the optimal degree.

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis

J. Parallel Distributed Comput., 2011

Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes. (Self-stabilizing algorithms for spanning tree construction and for the management of mobile entities).

Lélia Blin

, 2011

2010

Fast Self-Stabilizing Minimum Spanning Tree Construction

Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis

CoRR, 2010

Universal Loop-Free Super-Stabilization

Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil

CoRR, 2010

Hardness Results and Heuristic for Multi-groups Interconnection.

Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault

Comput. J., 2010

Exclusive Perpetual Ring Exploration without Chirality.

Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme.

Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Loop-Free Super-Stabilizing Spanning Tree Construction.

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

2009

A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis

CoRR, 2009

A Superstabilizing log(<i>n</i>)-Approximation Algorithm for Dynamic Steiner Trees.

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis

Proceedings of the Stabilization, 2009

2008

Distributed chasing of network intruders.

Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial

Theor. Comput. Sci., 2008

2007

On the Self-stabilization of Mobile Robots in Graphs.

Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006

Fair cost-sharing methods for the minimum spanning tree game.

Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès

Inf. Process. Lett., 2006

Distributed Approximation Allocation Resources Algorithm for Connecting Groups.

Fabien Baille, Lélia Blin, Christian Laforest

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2004

The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs.

Lélia Blin, Franck Butelle

Int. J. Found. Comput. Sci., 2004

2003

An Improved Snap-Stabilizing PIF Algorithm.

Lélia Blin, Alain Cournier, Vincent Villain

Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

2001

A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree.

Lélia Blin, Franck Butelle

Proceedings of the Procedings of the 5th International Conference on Principles of Distributed Systems. OPODIS 2001, 2001