Lélia Blin
Orcid: 0000-0003-0342-9243
According to our database1,
Lélia Blin
authored at least 41 papers
between 2001 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms.
Discret. Math. Theor. Comput. Sci., 2023
2022
Proceedings of the 41st International Symposium on Reliable Distributed Systems, 2022
2020
J. Parallel Distributed Comput., 2020
CoRR, 2020
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020
2019
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.
J. Parallel Distributed Comput., 2018
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative.
Distributed Comput., 2018
2017
Proceedings of the 31st International Symposium on Distributed Computing, 2017
2016
Comput. J., 2016
2015
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.
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.
CoRR, 2014
Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes.
Proceedings of the Distributed Computing - 28th International Symposium, 2014
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.
Theor. Comput. Sci., 2013
Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes.
CoRR, 2013
Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative.
Proceedings of the Distributed Computing - 27th International Symposium, 2013
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013
2012
Proceedings of the Distributed Computing - 26th International Symposium, 2012
2011
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).
, 2011
2010
Proceedings of the Distributed Computing, 24th International Symposium, 2010
Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme.
Proceedings of the Distributed Computing, 24th International Symposium, 2010
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010
2009
CoRR, 2009
Proceedings of the Stabilization, 2009
2008
2007
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007
2006
Inf. Process. Lett., 2006
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.
Int. J. Found. Comput. Sci., 2004
2003
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.
Proceedings of the Procedings of the 5th International Conference on Principles of Distributed Systems. OPODIS 2001, 2001