Publications

, 2018 
dblp googleScholar confsearch   core  SHERPA

 

 

2021

[C23] , Lélia Blin, Swan Dubois, Laurent Feuilloley:
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. OPODIS 2021 1 24:1-24:12

2020

[J12] , Lélia Blin et Sébastien Tixeuil:
Compact self-stabilizing leader election for general networks. J. Parallel Distributed Comput. 144: 278-294 2020
[C22]
Lélia Blin, Swan Dubois, Laurent Feuilloley:
Silent MST Approximation for Tiny Memory. (SSS 2020): pages:118-132, 2020

2019

[J11] , Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru et Sebastien Tixeuil : On Asynchronous Rendezvous in General Graphs. Theoretical Computer Science 753: 80-90, 2019.

2018

[J10] , Fadwa Boubekeur et Swan Dubois : A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon. Journal of Parallel and Distributed Computing 117: pages 50-62, 2018.
[J9] Lélia Blin, Sébastien Tixeuil : Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative. Distributed Computing. 31(2) pages:139-166.
[C21] Lelia Blin, Sebastien tixeuil: Compact Self-Stabilizing Leader Election for General Networks. The 13th Latin American Theoretical INformatics Symposium (LATIN 2018) pages: 161-173, 2018.

2017

  [B4] Lélia Blin, Sébastien Tixeuil : Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs. 31st International Symposium on Distributed Computing (DISC 2017), pages: 43:1-43:3, 2017.
[J8] Lélia Blin, Janna Burman, Nicolas Nisse : Exclusive Graph Searching . Algorithmica 77(3) pages:942-969, 2017.
 [N8] Lelia Blin, Sebastien Tixeuil : Algorithme Auto-Stabilisant Compact d'Election pour les Graphes Arbitraires. 19eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), INRIA pages:1-4, 2017.

2016

[J7] Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil : Loop-Free Super-Stabilizing Spanning Tree Construction . Comput. J. volume: 59 (3), pages:225-243, 2016.
 [N8] Lélia Blin, Fadwa Boubekeur et Swan Dubois : Algorithme auto-stabilisant efficace en mémoire pour la construction d’un arbre couvrant de diamètre minimum. 18eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), INRIA pages:1-4, 2016.

2015

  [C20] Lelia Blin, Pierre Fraignaud,: Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees . The 35th International Conference on Distributed Computing Systems (ICDCS 2015) pages:589-598, 2015.
  [C19] Lélia Blin, Fadwa Boubekeur, Swan Dubois : A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon . 29rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2015) pages:1065-1074, 2015.

  [C18] Fadwa Boubekeur, Lélia Blin, Rémy Léone, Paolo Medagliani : Bounding Degrees on RPL . Proceedings of the 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet 2015, Cancun, Mexico, November 2-6, 2015 pages:123-130, 2015.

2014

  [C17] Lélia Blin, Pierre Fraigniaud, Boaz Patt-Shamir : On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms . 16th International Symposium Stabilization, Safety, and Security of Distributed Systems, (SSS 2014) pages:18-32, 2014.
[B3] Lélia Blin, Pierre Fraigniaud : Brief Announcement: Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes . 28th International Symposium on Distributed Computing (DISC 2014) pages:565-566, 2014.
[N7] Lélia Blin, Pierre Fraigniaud : Construction auto-stabilisante silencieuse optimale en mémoire d'arbres couvants de degré minimum . 16eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), INRIA pages:1-4, 2014.

2013

[J6] Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis : A super-stabilizing log(n)log(n)-approximation algorithm for dynamic Steiner trees . Theor. Comput. Sci. volume: 500 pages:90-112, 2013.
  [C16] Lélia Blin, Janna Burman, Nicolas Nisse : Exclusive Graph Searching . 21st European Symposium on Algorithms (ESA 2013) pages:181-192, 2013.
[B2] Lélia Blin, Sébastien Tixeuil : Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits . 32Th ACM Symposium on Principles of Distributed Computing (PODC 2013) pages:125-127, 2013.
  [C15] Lélia Blin, Sébastien Tixeuil : Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative . 27th International Symposium on Distributed Computing (DISC 2013), Springer LNCS 8205 pages:76-90, 2013.
video

2012

[B1] Lélia Blin, Janna Burman, Nicolas Nisse : Brief Announcement: Distributed Exclusive and Perpetual Tree Searching . Distributed Computing - 26th International Symposium, (DISC 2012) pages:403-404, 2012.
[E1] Lélia Blin and Yann Busnel 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, (TADDS 2012) ACM 2012
[N6] Lélia Blin, Janna Burman, Nicolas Nisse : Nettoyage perpétuel de réseaux . 14eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), INRIA pages:13-16, 2012.

2011

[J5] 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. volume: 71 (3), pages:438-449, 2011.
[N5] Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis : Construction auto-stabilisante d'un arbre couvrant de poids minimum . 13eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), INRIA pages:13-16, 2011.
[D2]Lélia Blin : HDR: Algorithmes auto-stabilisants pour la constructions d'arbres couvrants et la gestion déntités autonomes . University Pierre and Marie Curie (UPMC) pages:0-65, 2011.

2010

[J4] Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault : Hardness Results and Heuristic for Multi-groups Interconnection . Comput. J. volume: 53 (9), pages:1497-1507, 2010.
  [C14] 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 . 24th International Symposium on Distributed Computing (DISC 2010), Springer LNCS 6343 pages:480-494, 2010.
[C13] Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil : Exclusive Perpetual Ring Exploration without Chirality . 24th International Symposium on Distributed Computing (DISC 2010), Springer LNCS 6343 pages:312-327, 2010.
[C12] Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil : Loop-Free Super-Stabilizing Spanning Tree Construction . 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), Springer LNCS 6366 pages:50-64, 2010.

2009

[C11] Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil : A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property . 23rd International Symposium on Distributed Computing (DISC 2009), Springer LNCS 5805 pages:407-422, 2009.
[C10] Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis : Self-stabilizing minimum-degree spanning tree within one from the optimal degree . 23rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2009) pages:1-11, 2009.
[C9] Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis : A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees . 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), Springer LNCS 5873 pages:133-148, 2009.
[N4] Lélia Blin, Christian Laforest, Stephane Rovedakis : $log(n)$-approximation d'un arbre de Steiner auto-stabilisant et dynamique . 11eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), INRIA pages:13-16, 2009.

2008

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

2007

[C8] Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil : On the Self-stabilization of Mobile Robots in Graphs . 11th International Conference On Principles Of Distributed Systems (OPODIS 2007), Springer LNCS 4878 pages:301-314, 2007.
[N3] Lélia Blin, Christian Laforest, Stephane Rovedakis : Interconnexion multi-groupes . 9eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), INRIA pages:41-44, 2007.

2006

[J2] Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès : Fair cost-sharing methods for the minimum spanning tree game . Inf. Process. Lett. volume: 100 (1), pages:29-35, 2006.
[C7] Fabien Baille, Lélia Blin, Christian Laforest : Distributed Approximation Allocation Resources Algorithm for Connecting Groups . 12th European Conference on Parallel Computing (Euro-par 2006), Springer LNCS 4128 pages:45-48, 2006.
[N2] Fabien Baille, Lélia Blin, Christian Laforest : Algorithme distribué tricritere pour la construction de structures de connexions . 8eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), INRIA pages:89-92, 2006.
[C6] Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial : Distributed Chasing of Network Intruders . 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), Springer, LNCS 4056 pages:70-84, 2006.
[N1] Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial : Encerclement réparti d'un fugitif dans un réseau par des agents mobiles . 8eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), INRIA pages:89-92, 2006.

2005

[C5] Dominique Barth, Lélia Blin, Loubna Echabbi, Sandrine Vial : Distributed cost management in a selfish multi-operators BGP network . 1st Conference on Next Generation Internet Networks (NGI 2005), IEEE pages:24-30, 2005.

2004

[J1] Lélia Blin, Franck Butelle : The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs . International Journal of Foundations of Computer Science volume: 15 (3), pages:507-516, 2004.

2003

[C4] Lélia Blin, Alain Cournier, Vincent Villain : An Improved Snap-Stabilizing PIF Algorithm . 6th International Symposium on Self-Stabilizing Systems (SSS 2003), Springer, LNCS 2704 pages:199-214, 2003.
[C3] Lélia Blin, Franck Butelle : The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs . 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), IEEE, CDRom 10 pages pages:161, 2003.

2002

[R2] Lélia Blin : A Randomized Heuristic for the Min-Cut $k$-Balanced Partitioning Problem . 16th Conference of the European Chapter on Combinatorial Optimisation (ECCO 2001) pages:1-3, 2002.

2001

[C2] Lélia Blin, Franck Butelle : A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree . Procedings of the 5th International Conference on Principles of Distributed Systems, (OPODIS 2001) pages:113-124, 2001.
[R1] Lélia Blin : A Distributed Merging Algorithm for the Minimum Spanning Tree Problem . 15th Conference of the European Chapter on Combinatorial Optimisation (ECCO 2001) pages:1-3, 2001.
[D1] Lélia Blin : These: K-partionnement de graphes du séquentiel au distribué . University Paris VIII pages:, 2001.

1999

[C1] Lélia Blin, Ivan Lavallée : A Simple Heuristic Method for the Min-Cut k-Balanced Partitionning Problem . Intl. Conf. on Mathematical Foundation of Informatics, World Scientific Publishing Company, pages:55-66, 1999.

Journaux: 12
[11] JPDC 2020
[11] TCS 2019
[10] JPDC 2018
[9] Distributed Computing 2018
[8] Algorithmica 2017
[7] The computer J. 2016
[6] TCS 2013
[5] JPDC 2011
[4] The computer J. 2010
[3] TCS 2008
[2] IPL 2006
[1] IJFCS 2004
Conferences: 23
[23] OPODIS 2021
[22] SSS 2020
[21] LATIN 2018
[20] ICDCN 2015
[19] IPDPS 2015
[18] Q2SWinet 2015
[17] SSS 2014
[16] ESA 2013
[15] DISC 2013
[14] DISC 2010
[13] DISC 2010
[12] SSS 2010
[11] DISC 2009
[10] IPDPS 2009
[09] SSS 2009
[08] OPODIS 2007
[07] Euro-par 2006
[06] SIROCCO 2006
[05] NGI 2005
[04] SSS 2003
[03] IPDPS 2003
[02] OPODIS 2001
[01] MFI 1999