Nombre de documents

57

Mes Publications


Blin Lélia


Article dans une revue11 documents

Communication dans un congrès34 documents

  • Lélia Blin, Fadwa Boubekeur, Swan Dubois. Algorithme auto-stabilisant efficace en mémoire pour la construction d'un arbre couvrant de diamètre minimum. ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France. <hal-01302779>
  • Fadwa Boubekeur, Lélia Blin, Rémy Leone, Paolo Medagliani. Bounding Degrees on RPL. The 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet 2015, Nov 2015, Cancun, Mexico. ACM, Proceedings of the 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet 2015, pp.123-130, 2015, <10.1145/2815317.2815339>. <hal-01269834>
  • 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), May 2015, Hyberabad, India. IEEE, Parallel and Distributed Processing Symposium (IPDPS), 2015 IEEE International, pp.1065-1074, 2015, <10.1109/IPDPS.2015.44>. <hal-01201859>
  • Lélia Blin, Pierre Fraigniaud. Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees. 35th IEEE International Conference on Distributed Computing Systems (ICDCS), Jun 2015, Columbus, United States. IEEE, pp.589-598, 2015, <10.1109/ICDCS.2015.66>. <hal-01247340>
  • Lélia Blin, Pierre Fraigniaud, Boaz Patt-Shamir. On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms. Pascal Felber; Vijay Garg. SSS 2014 - 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Sep 2014, Paderborn, Germany. Springer, 8756, pp.18-32, LNCS - Lecture Notes in Computer Science. <10.1007/978-3-319-11764-5_2>. <hal-01102123>
  • 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), Oct 2014, Austin Texas, United States. Springer, pp.565-566. <hal-01206324>
  • Lélia Blin, Pierre Fraigniaud. Construction auto-stabilisante silencieuse optimale en mémoire d'arbres couvants de degré minimum. ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4, 2014. <hal-00983011>
  • Lélia Blin, Sébastien Tixeuil. Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative. DISC 2013 - 27th International Symposium on Distributed Computing, Oct 2013, Jerusalem, Israel. Springer, 8205, pp.76-90, 2013, Lecture Notes in Computer Science. <10.1007/978-3-642-41527-2_6>. <hal-00930095>
  • Lélia Blin, Sébastien Tixeuil. Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits. ACM Symposium on Principles of Distributed Computing, Jul 2013, Montreal, Canada. ACM, pp.125-127, 2013, <10.1145/2484239.2484289>. <hal-00930090>
  • Lélia Blin, Janna Burman, Nicolas Nisse. Exclusive Graph Searching. 21st European Symposium on Algorithms (ESA 2013), Sep 2013, Sophia Antipolis, France. Springer, 8125, pp.181-192, 2013, Lecture Notes in Computer Science. <10.1007/978-3-642-40450-4_16>. <hal-00845530>
  • Lélia Blin, Janna Burman, Nicolas Nisse. Brief Announcement: Distributed Exclusive and Perpetual Tree Searching. DISC 2012 - 26th International Symposium on Distributed Computing, Oct 2012, Salvador, Brazil. Springer, 7611, pp.403-404, 2012, Lecture Notes in Computer Science. <10.1007/978-3-642-33651-5_29>. <hal-00741982>
  • Lélia Blin, Janna Burman, Nicolas Nisse. Nettoyage perpétuel de réseaux. Mathieu, Fabien et Hanusse, Nicolas. 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France. 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pp.4, 2012. <hal-00687134>
  • Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis. Construction auto-stabilisante d'un arbre couvrant de poids minimum. Ducourthial, Bertrand et Felber, Pascal. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), May 2011, Cap Estérel, France. 2011. <inria-00587591>
  • Lélia Blin, Franck Butelle. A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. OPODIS, 2010, Manzanillo, Mexico. OPODIS, pp.113-124. <hal-01310357>
  • 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 - 24th International Symposium on Distributed Computing, Sep 2010, Cambridge, MA, United States. 6343, pp.480--494, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-15763-9_46>. <hal-00820200>
  • Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil. Exclusive Perpetual Ring Exploration without Chirality. Nancy A. Lynch and Alexander A. Shvartsman. DISC 2010 - 24th International Symposium Distributed Computing, Sep 2010, Cambridge, MA, United States. Springer, 6343, pp.312-327, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-15763-9_29>. <hal-00992700>
  • 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), Sep 2010, New York, NY, United States. 6366, pp.50--64, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-16023-3_7>. <hal-00668381>
  • 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), Nov 2009, Lyon, France. Springer, 5873, pp.133--148, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-05118-0_10>. <hal-00869624>
  • 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), Sep 2009, Elche, Spain. 5805, pp.407--422, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-04355-0_43>. <hal-00869591>
  • Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis. log(n)-approximation d'un arbre de Steiner auto-stabilisant et dynamique. Chaintreau, Augustin and Magnien, Clemence. 11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Jun 2009, Carry-Le-Rouet, France. 2009. <inria-00383216>
  • 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&Distributed Processing (IPDPS 2009), May 2009, Rome, Italy. IEEE, pp.1-11, 2009, <10.1109/IPDPS.2009.5161042>. <hal-00668359>
  • Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault. Interconnexion multi-groupes. 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.41-44, 2007. <inria-00176947>
  • 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, 2006, Guadeloupe, France. 4878, pp.301-314, 2007, Lecture Notes in Computer Science. <10.1007/978-3-540-77096-1_22>. <hal-01311362>
  • Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Distributed Chasing of Network Intruders. 13th International Colloquium on Structural Information and Communication Complexity, 2006, Chester, United Kingdom. 4056, pp.70-84, 2006, Lecture Notes in Computer Science. <10.1007/11780823_7>. <hal-01311355>
  • Fabien Baille, Lélia Blin, Christian Laforest. Distributed Approximation Allocation Resources Algorithm for Connecting Groups. Euro-Par, 2006, Germany. pp.519--529, 2006, Lecture Notes in Computer Science. <10.1007/11823285_54>. <hal-00341986>
  • Fabien Baille, Lélia Blin, Christian Laforest. Algorithme distribué tricritère pour la construction de structures de connexions. Actes des Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 2006, France. pp.45--48, 2006. <hal-00341985>
  • Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Distributed Chasing of Network Intruders by Mobile Agents. Proceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), 2006, United Kingdom. 4056, pp.70--84, 2006, Lecture Notes in Computer Science. <10.1007/11780823_7>. <hal-00342000>
  • Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. Encerclement réparti d'un fugitif dans un réseau par des agents mobiles. Actes des Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 2006, France. pp.89--92, 2006. <hal-00342001>
  • Dominique Barth, Lélia Blin, Loubna Echabbi, Sandrine Vial. Distributed Cost Management in a Selfish Multi-Operators BGP Network. 2005, IEEE, pp.CD, 2005. <hal-00126486>
  • Dominique Barth, Lélia Blin, Loubna Echabbi, Sandrine Vial. Distributed cost management in a selfish multi-operators BGP network. Proceedings of the first EuroNGI Conference on Traffic Engineering for the Next Generation Internet, 2005, Italy. pp.24--30, 2005, <10.1109/NGI.2005.1431643>. <hal-00341996>
  • Lélia Blin, Vincent Villain, Alain Cournier. An Improved Snap-Stabilizing {PIF} Algorithm. SSS, 2003, San Frisco, United States. 2704, 2003, Lecture Notes in Computer Science SSS 2003. <10.1007/3-540-45032-7_15>. <hal-01310823>
  • Lélia Blin, Franck Butelle. The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. IPDPS, 2003, Nice, France. IPDPS, pp.161, 2003. <hal-01310359>
  • Lélia Blin, Franck Butelle. The first Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graph. IPDPS, 2003, France. IEEE Computer Society Press, pp.161 (résumé, article sur CDROM), 2003, CDROM. <10.1109/IPDPS.2003.1213299>. <hal-00082562>
  • Lélia Blin, Franck Butelle. A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. OPODIS 2001, 2001, France. SUGER, pp.113-124, 2001, Vol.2 Hors-Série 2. <hal-00134604>

Ouvrage (y compris édition critique et traduction)2 documents

  • Lélia Blin, Yann Busnel. Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS 2012). Lélia Blin, Yann Busnel. ACM New York, NY, USA, pp.43, 2012, ICPS, 978-1-4503-1849-5. <hal-00788158>
  • Lélia Blin, Yann Busnel. DYNAM: Proceedings of the 1st International Workshop on Dynamicity. Lélia Blin, Yann Busnel. LAAS / CNRS, pp.22, 2011, Lélia Blin, Yann Busnel. <hal-00725096>

Pré-publication, Document de travail4 documents

  • Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis. Fast Self-Stabilizing Minimum Spanning Tree Construction. 2010. <hal-00492398v2>
  • Lélia Blin, Stephane Rovedakis, Maria Potop-Butucaru, Sébastien Tixeuil. Universal Loop-Free Super-Stabilization. 2010. <hal-00492320>
  • Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis. A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees. 2009. <hal-00363003>
  • Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis. Self-stabilizing minimum-degree spanning tree within one from the optimal degree. 2008. <inria-00336713>

Rapport5 documents

  • 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. [Research Report] LIP6 UMR 7606, INRIA, UPMC Sorbonne Universités, France. 2013. <hal-00879578>
  • Lélia Blin, Janna Burman, Nicolas Nisse. Perpetual Graph Searching. [Research Report] INRIA. 2012. <hal-00675233>
  • Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil. Exclusive perpetual ring exploration without chirality. [Research Report] Université d'Evry Val d'Essonne. 2010, pp.17. <inria-00464206>
  • Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil. A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property. [Research Report] Université d'Evry Val d'Essonne. 2009. <inria-00384041>
  • Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil. On the Self-stabilization of Mobile Robots in Graphs. [Research Report] RR-6266, INRIA. 2007, pp.23. <inria-00166547v2>

HDR1 document

  • Lélia Blin. Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes. Algorithme et structure de données [cs.DS]. Université Pierre et Marie Curie - Paris VI, 2011. <tel-00847179>