Publications 2001-2024

• 2024
  • L. Blin, A. Durand, S. Tixeuil : “Resource efficient stabilization for local tasks despite unknown capacity links”, Theoretical Computer Science, vol. 1013 (1), pp. 114744, (Elsevier) (2024)
  • L. Blin, G. Le Bouder, F. Petit : “Optimal Memory Requirement for Self-Stabilizing Token Circulation”, Lecture Notes in Computer Science, vol. 14662, Lecture Notes in Computer Science, Salerno, Italy, pp. 101–118, (Springer), (ISBN: 978-3-031-60602-1) (2024)
• 2023
  • L. Blin, C. Johnen, G. Le Bouder, F. Petit : “Silent Anonymous Snap-Stabilizing Termination Detection”, 2022 41^st International Symposium on Reliable Distributed Systems (SRDS), Vienna, Austria, pp. 156-165, (IEEE), (ISBN: 978-1-6654-9753-4) (2023)
  • L. Blin, L. Feuilloley, G. Le Bouder : “Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms”, Discrete Mathematics and Theoretical Computer Science, vol. 25 (1), LIPIcs, pp. 5, (DMTCS) (2023)
• 2022
  • L. Blin, L. Feuilloley, G. Le Bouder : “Borne inférieure optimale pour la complexité spatiale des algorithmes déterministes auto-stabilisants d’élection”, AlgoTel 2022 - 24^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint-Rémy-Lès-Chevreuse, France (2022)
  • L. Blin, C. Johnen, G. Le Bouder, F. Petit : “Détection de terminaison silencieuse, anonyme, stabilisante instantanément”, AlgoTel 2022 - 24^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint-Rémy-Lès-Chevreuse, France (2022)
• 2020
  • L. Blin, S. Dubois, L. Feuilloley : “Silent MST Approximation for Tiny Memory”, SSS 2020 : The 22^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 12514, Lecture Notes in Computer Science, Austin, TX / Virtual, United States, pp. 118-132, (Springer, Cham.) (2020)
  • L. Blin, A. Durand, S. Tixeuil : “Resource Efficient Stabilization for Local Tasks despite Unknown Capacity Links”, (2020)
  • L. Blin, A. Durand, S. Tixeuil : “On peut tromper mille personnes mille fois, mais pas plus”, ALGOTEL 2020 - 22^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Lyon, France, pp. 156-165, (ACM) (2020)
  • L. Blin, S. Tixeuil : “Compact self-stabilizing leader election for general networks”, Journal of Parallel and Distributed Computing, (Elsevier) (2020)
• 2019
  • E. Bampas, L. Blin, J. Czyzowicz, D. Ilcinkas, A. Labourel, M. Potop‑Butucaru, S. Tixeuil : “On asynchronous rendezvous in general graphs”, Theoretical Computer Science, vol. 753, pp. 80-90, (Elsevier) (2019)
• 2018
  • L. Blin, F. Boubekeur, S. Dubois : “A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon”, Journal of Parallel and Distributed Computing, vol. 117, pp. 50-62, (Elsevier) (2018)
  • L. Blin, S. Tixeuil : “Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative”, Distributed Computing, vol. 31 (2), pp. 139-166, (Springer Verlag) (2018)
  • L. Blin, S. Tixeuil : “Compact Self-Stabilizing Leader Election for General Networks”, LATIN 2018 - 13^th Latin American Symposium on Theoretical Informatics, vol. 10807, Lecture Notes in Computer Science, Buenos Aires, Argentina, pp. 161-173, (Springer) (2018)
• 2017
  • L. Blin, S. Tixeuil : “Algorithme Auto-Stabilisant Compact d’Election pour les Graphes Arbitraires”, ALGOTEL 2017 - 19^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Quiberon, France (2017)
  • L. Blin, J. Burman, N. Nisse : “Exclusive Graph Searching”, Algorithmica, vol. 77 (3), pp. 942-969, (Springer Verlag) (2017)
  • L. Blin, S. Tixeuil : “Brief announcement: Compact Self-Stabilizing Leader Election for General Networks”, Proceedings of DISC 2017, Vienna, Austria (2017)
• 2016
  • L. Blin, F. Boubekeur, S. Dubois : “Algorithme auto-stabilisant efficace en mémoire pour la construction d’un arbre couvrant de diamètre minimum”, ALGOTEL 2016 - 18^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France (2016)
  • L. Blin, M. Potop‑Butucaru, S. Rovedakis, S. Tixeuil : “A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property”, The Computer Journal, vol. 59 (2), pp. 225-243, (Oxford University Press (UK)) (2016)
• 2015
  • L. Blin, F. Giroire : “17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications”, 17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France (2015)
  • F. Boubekeur, L. Blin, R. Leone, P. Medagliani : “Bounding Degrees on RPL”, Proceedings of the 11^th ACM Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet 2015, Cancun, Mexico, pp. 123-130, (ACM) (2015)
  • L. Blin, P. Fraigniaud : “Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees”, 35^th IEEE International Conference on Distributed Computing Systems (ICDCS), Columbus, United States, pp. 589-598, (IEEE) (2015)
  • L. Blin, F. Boubekeur, S. Dubois : “A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon”, Parallel and Distributed Processing Symposium (IPDPS), 2015 IEEE International, Hyberabad, India, pp. 1065-1074, (IEEE) (2015)
• 2014
  • L. Blin, P. Fraigniaud : “Brief Announcement: Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes”, 28^th International Symposium on Distributed Computing (DISC 2014), Austin Texas, United States, pp. 565-566, (Springer) (2014)
  • L. Blin, P. Fraigniaud, B. Patt‑Shamir : “On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms”, SSS 2014 - 16^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 8756, LNCS - Lecture Notes in Computer Science, Paderborn, Germany, pp. 18-32, (Springer) (2014)
  • L. Blin, P. Fraigniaud : “Construction auto-stabilisante silencieuse optimale en mémoire d’arbres couvants de degré minimum”, ALGOTEL 2014 -- 16^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Le Bois-Plage-en-Ré, France, pp. 1-4 (2014)
• 2013
  • L. Blin, S. Tixeuil : “Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative”, DISC 2013 - 27^th International Symposium on Distributed Computing, vol. 8205, Lecture Notes in Computer Science, Jerusalem, Israel, pp. 76-90, (Springer) (2013)
  • L. Blin, M. Potop‑Butucaru, S. Rovedakis : “A super-stabilizing log(n)-approximation algorithm for dynamic Steiner trees”, Theoretical Computer Science, vol. 500, pp. 90-112, (Elsevier) (2013)
  • L. Blin, Sh. Dolev, M. Gradinariu Potop‑Butucaru, S. Rovedakis : “Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme”, (2013)
  • L. Blin, S. Tixeuil : “Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits”, ACM Symposium on Principles of Distributed Computing, Montreal, Canada, pp. 125-127, (ACM) (2013)
  • L. Blin, J. Burman, N. Nisse : “Exclusive Graph Searching”, 21^st European Symposium on Algorithms (ESA 2013), vol. 8125, Lecture Notes in Computer Science, Sophia Antipolis, France, pp. 181-192, (Springer) (2013)
• 2012
  • L. Blin, Y. Busnel : “Proceedings of the 4^th International Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS 2012)”, ICPS, pp. 43, (ACM New York, NY, USA), (ISBN: 978-1-4503-1849-5) (2012)
  • L. Blin, J. Burman, N. Nisse : “Perpetual Graph Searching”, (2012)
  • L. Blin, J. Burman, N. Nisse : “Brief Announcement: Distributed Exclusive and Perpetual Tree Searching”, DISC 2012 - 26^th International Symposium on Distributed Computing, vol. 7611, Lecture Notes in Computer Science, Salvador, Brazil, pp. 403-404, (Springer) (2012)
  • L. Blin, J. Burman, N. Nisse : “Nettoyage perpétuel de réseaux”, 14^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France, pp. 4 (2012)
• 2011
  • L. Blin : “Algorithmes auto-stabilisants pour la constructions d’arbres couvrants et la gestion d’entités autonomes”, habilitation à diriger des recherches, soutenance 01/12/2011 (2011)
  • L. Blin, Y. Busnel : “DYNAM: Proceedings of the 1^st International Workshop on Dynamicity”, pp. 22, (LAAS / CNRS) (2011)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Rovedakis : “Self-stabilizing minimum degree spanning tree within one from the optimal degree”, Journal of Parallel and Distributed Computing, vol. 71 (3), pp. 438-449, (Elsevier) (2011)
  • L. Blin, Sh. Dolev, M. Potop‑Butucaru, S. Rovedakis : “Construction auto-stabilisante d’un arbre couvrant de poids minimum”, 13^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France (2011)
• 2010
  • L. Blin, S. Rovedakis, M. Potop‑Butucaru, S. Tixeuil : “Universal Loop-Free Super-Stabilization”, (2010)
  • L. Blin, A. Milani, M. Potop‑Butucaru, S. Tixeuil : “Exclusive perpetual ring exploration without chirality”, 17 pages (2010)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Rovedakis, S. Tixeuil : “Loop-Free Super-Stabilizing Spanning Tree Construction”, 12^th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), vol. 6366, Lecture Notes in Computer Science, New York, NY, United States, pp. 50-64 (2010)
  • L. Blin, A. Milani, M. Potop‑Butucaru, S. Tixeuil : “Exclusive Perpetual Ring Exploration without Chirality”, DISC 2010 - 24^th International Symposium Distributed Computing, vol. 6343, Lecture Notes in Computer Science, Cambridge, MA, United States, pp. 312-327, (Springer) (2010)
  • L. Blin, Sh. Dolev, M. Potop‑Butucaru, S. Rovedakis : “Fast Self-Stabilizing Minimum Spanning Tree Construction”, DISC 2010 - 24^th International Symposium on Distributed Computing, vol. 6343, Lecture Notes in Computer Science, Cambridge, MA, United States, pp. 480-494, (Springer) (2010)
  • L. Blin, Ch. Laforest, S. Rovedakis, N. Thibault : “Hardness Results and Heuristic for Multi-groups Interconnection”, The Computer Journal, vol. 53 (9), pp. 1497-1507, (Oxford University Press (UK)) (2010)
  • L. Blin, F. Butelle : “A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree”, OPODIS, Manzanillo, Mexico, pp. 113-124 (2010)
  • L. Blin, Ch. Laforest, S. Rovedakis, N. Thibault : “Hardness Results and Heuristic for Multi-groups Interconnection”, The Computer Journal, vol. 53 (9), pp. 1497-1507, (Oxford University Press (UK)) (2010)
• 2009
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Rovedakis : “A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees”, 11^th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), vol. 5873, Lecture Notes in Computer Science, Lyon, France, pp. 133-148, (Springer) (2009)
  • L. Blin, M. Potop‑Butucaru, S. Rovedakis, S. Tixeuil : “A new self-stabilizing minimum spanning tree construction with loop-free property”, 23^rd International Symposium on Distributed Computing (DISC 2009), vol. 5805, Lecture Notes in Computer Science, Elche, Spain, pp. 407-422 (2009)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Rovedakis : “log(n)-approximation d’un arbre de Steiner auto-stabilisant et dynamique”, 11^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Carry-Le-Rouet, France (2009)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Rovedakis : “Self-stabilizing minimum-degree spanning tree within one from the optimal degree”, 23^rd IEEE International Symposium on Parallel&Distributed Processing (IPDPS 2009), Rome, Italy, pp. 1-11, (IEEE) (2009)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Rovedakis, S. Tixeuil : “A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property”, (2009)
• 2008
  • L. Blin, P. Fraigniaud, N. Nisse, S. Vial : “Distributed Chasing of Network Intruders by Mobile Agents.”, Theoretical Computer Science, vol. 399 (1-2), pp. 12-37, (Elsevier) (2008)
• 2007
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “On the Self-stabilization of Mobile Robots in Graphs”, OPODIS 2007 - 11^th International Conference on Principles of Distributed Systems, vol. 4878, Lecture Notes in Computer Science, Guadeloupe, France, pp. 301-314, (Springer) (2007)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “On the Self-stabilization of Mobile Robots in Graphs”, 23 pages (2007)
  • L. Blin, Ch. Laforest, S. Rovedakis, N. Thibault : “Interconnexion multi-groupes”, 9^e Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Ile d'Oléron, France, pp. 41-44 (2007)
• 2006
  • F. Baille, L. Blin, Ch. 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), France, pp. 45-48 (2006)
  • F. Baille, L. Blin, Ch. Laforest : “Distributed Approximation Allocation Resources Algorithm for Connecting Groups”, Euro-Par, Lecture Notes in Computer Science, Germany, pp. 519-529 (2006)
  • L. Blin, P. Fraigniaud, N. Nisse, S. Vial : “Distributed Chasing of Network Intruders”, 13^th International Colloquium on Structural Information and Communication Complexity, vol. 4056, Lecture Notes in Computer Science, Chester, United Kingdom, pp. 70-84 (2006)
  • L. Blin, P. Fraigniaud, N. Nisse, S. Vial : “Distributed Chasing of Network Intruders by Mobile Agents”, Proceedings of the 13^th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), vol. 4056, Lecture Notes in Computer Science, Chester, United Kingdom, pp. 70-84 (2006)
  • L. Blin, P. Fraigniaud, N. Nisse, S. 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), France, pp. 89-92 (2006)
  • E. Angel, E. Bampis, L. Blin, L. Gourvès : “Fair cost-sharing methods for the minimum spanning tree game”, Information Processing Letters, vol. 100, pp. 29-35, (Elsevier) (2006)
• 2005
  • D. Barth, L. Blin, L. Echabbi, S. Vial : “Distributed Cost Management in a Selfish Multi-Operators BGP Network”, Next Generation Internet Networks, Rome, Italy, pp. cd, (IEEE) (2005)
  • D. Barth, L. Blin, L. Echabbi, S. 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, Italy, pp. 24-30 (2005)
• 2004
  • L. Blin, F. Butelle : “The first Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs”, International Journal of Foundations of Computer Science, vol. 15, pp. 507-516, (World Scientific Publishing) (2004)
  • L. Blin, F. Butelle : “The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs.”, International Journal of Foundations of Computer Science, vol. 15 (1), pp. 507-516, (World Scientific Publishing) (2004)
• 2003
  • L. Blin, V. Villain, A. Cournier : “An Improved Snap-Stabilizing {PIF} Algorithm”, SSS, vol. 2704, Lecture Notes in Computer Science SSS 2003, San Frisco, United States (2003)
  • L. Blin, F. Butelle : “The first Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graph”, proc. IEEE 17^th International Parallel and Distributed Processing Symposium, CDROM, France, pp. 161 (résumé, article sur cdrom), (IEEE Computer Society Press) (2003)
  • L. Blin, F. Butelle : “The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs”, IPDPS, Nice, France, pp. 161 (2003)
• 2001
  • L. Blin, F. Butelle : “A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree”, Studia Informatica Universalis, Hors Série, N°ISBN:2-912590-14-0, Vol.2 Hors-Série 2., France, pp. 113-124, (SUGER) (2001)