Lélia Blin
63
Documents
Presentation
**Blin Lélia**
**Blin Lélia**
Publications
- 18
- 16
- 11
- 9
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 3
- 3
- 2
- 1
- 1
- 1
- 1
|
Borne inférieure optimale pour la complexité spatiale des algorithmes déterministes auto-stabilisants d'électionAlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France
Conference papers
hal-03651152v2
|
|
Détection de terminaison silencieuse, anonyme, stabilisante instantanémentAlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France
Conference papers
hal-03651261v2
|
|
On peut tromper mille personnes mille fois, mais pas plusALGOTEL 2020 - 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France. pp.156-165
Conference papers
hal-03746708v1
|
|
Silent MST Approximation for Tiny MemorySSS 2020 : The 22th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2020, Austin, TX / Virtual, United States. pp.118-132, ⟨10.1007/978-3-030-64348-5_10⟩
Conference papers
hal-03140584v1
|
Compact Self-Stabilizing Leader Election for General NetworksLATIN 2018 - 13th Latin American Symposium on Theoretical Informatics, Apr 2018, Buenos Aires, Argentina. pp.161-173, ⟨10.1007/978-3-319-77404-6_13⟩
Conference papers
hal-02076468v1
|
|
|
Algorithme Auto-Stabilisant Compact d'Election pour les Graphes ArbitrairesALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Conference papers
hal-01512950v1
|
Brief announcement: Compact Self-Stabilizing Leader Election for General Networks31st International Symposium on Distributed Computing (DISC 2017), Oct 2017, Vienna, Austria
Conference papers
hal-01553088v1
|
|
|
Algorithme auto-stabilisant efficace en mémoire pour la construction d'un arbre couvrant de diamètre minimumALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France
Conference papers
hal-01302779v1
|
|
Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees35th IEEE International Conference on Distributed Computing Systems (ICDCS), Jun 2015, Columbus, United States. pp.589-598, ⟨10.1109/ICDCS.2015.66⟩
Conference papers
hal-01247340v1
|
A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon29rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2015), May 2015, Hyberabad, India. pp.1065-1074, ⟨10.1109/IPDPS.2015.44⟩
Conference papers
hal-01201859v1
|
|
Bounding Degrees on RPLThe 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet 2015, Nov 2015, Cancun, Mexico. pp.123-130, ⟨10.1145/2815317.2815339⟩
Conference papers
hal-01269834v1
|
|
|
Construction auto-stabilisante silencieuse optimale en mémoire d'arbres couvants de degré minimumALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4
Conference papers
hal-00983011v1
|
On Proof-Labeling Schemes versus Silent Self-stabilizing AlgorithmsSSS 2014 - 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Sep 2014, Paderborn, Germany. pp.18-32, ⟨10.1007/978-3-319-11764-5_2⟩
Conference papers
hal-01102123v1
|
|
Brief Announcement: Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes28th International Symposium on Distributed Computing (DISC 2014), Oct 2014, Austin Texas, United States. pp.565-566
Conference papers
hal-01206324v1
|
|
Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being TalkativeDISC 2013 - 27th International Symposium on Distributed Computing, Oct 2013, Jerusalem, Israel. pp.76-90, ⟨10.1007/978-3-642-41527-2_6⟩
Conference papers
hal-00930095v1
|
|
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bitsACM Symposium on Principles of Distributed Computing, Jul 2013, Montreal, Canada. pp.125-127, ⟨10.1145/2484239.2484289⟩
Conference papers
hal-00930090v1
|
|
|
Exclusive Graph Searching21st European Symposium on Algorithms (ESA 2013), Sep 2013, Sophia Antipolis, France. pp.181-192, ⟨10.1007/978-3-642-40450-4_16⟩
Conference papers
hal-00845530v1
|
|
Nettoyage perpétuel de réseaux14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France. pp.4
Conference papers
hal-00687134v1
|
|
Brief Announcement: Distributed Exclusive and Perpetual Tree SearchingDISC 2012 - 26th International Symposium on Distributed Computing, Oct 2012, Salvador, Brazil. pp.403-404, ⟨10.1007/978-3-642-33651-5_29⟩
Conference papers
hal-00741982v1
|
|
Construction auto-stabilisante d'un arbre couvrant de poids minimum13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), May 2011, Cap Estérel, France
Conference papers
inria-00587591v1
|
Exclusive Perpetual Ring Exploration without ChiralityDISC 2010 - 24th International Symposium Distributed Computing, Sep 2010, Cambridge, MA, United States. pp.312-327, ⟨10.1007/978-3-642-15763-9_29⟩
Conference papers
hal-00992700v1
|
|
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning TreeOPODIS, 2010, Manzanillo, Mexico. pp.113-124
Conference papers
hal-01310357v1
|
|
Loop-Free Super-Stabilizing Spanning Tree Construction12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), Sep 2010, New York, NY, United States. pp.50--64, ⟨10.1007/978-3-642-16023-3_7⟩
Conference papers
hal-00668381v1
|
|
|
Fast Self-Stabilizing Minimum Spanning Tree ConstructionDISC 2010 - 24th International Symposium on Distributed Computing, Sep 2010, Cambridge, MA, United States. pp.480-494, ⟨10.1007/978-3-642-15763-9_46⟩
Conference papers
hal-00492398v2
|
A new self-stabilizing minimum spanning tree construction with loop-free property23rd International Symposium on Distributed Computing (DISC 2009), Sep 2009, Elche, Spain. pp.407--422, ⟨10.1007/978-3-642-04355-0_43⟩
Conference papers
hal-00869591v1
|
|
|
A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), Nov 2009, Lyon, France. pp.133-148, ⟨10.1007/978-3-642-05118-0_10⟩
Conference papers
hal-00363003v1
|
|
log(n)-approximation d'un arbre de Steiner auto-stabilisant et dynamique11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Jun 2009, Carry-Le-Rouet, France
Conference papers
inria-00383216v1
|
|
Self-stabilizing minimum-degree spanning tree within one from the optimal degree23rd IEEE International Symposium on Parallel&Distributed Processing (IPDPS 2009), May 2009, Rome, Italy. pp.1-11, ⟨10.1109/IPDPS.2009.5161042⟩
Conference papers
inria-00336713v1
|
|
Interconnexion multi-groupes9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.41-44
Conference papers
inria-00176947v1
|
On the Self-stabilization of Mobile Robots in GraphsOPODIS 2007 - 11th International Conference on Principles of Distributed Systems, Dec 2007, Guadeloupe, France. pp.301-314, ⟨10.1007/978-3-540-77096-1_22⟩
Conference papers
hal-01311362v1
|
|
Distributed Chasing of Network Intruders13th International Colloquium on Structural Information and Communication Complexity, 2006, Chester, United Kingdom. pp.70-84, ⟨10.1007/11780823_7⟩
Conference papers
hal-01311355v1
|
|
Encerclement réparti d'un fugitif dans un réseau par des agents mobilesActes des Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 2006, France. pp.89--92
Conference papers
hal-00342001v1
|
|
Distributed Approximation Allocation Resources Algorithm for Connecting GroupsEuro-Par, 2006, Germany. pp.519--529, ⟨10.1007/11823285_54⟩
Conference papers
hal-00341986v1
|
|
|
Distributed Chasing of Network Intruders by Mobile AgentsProceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), 2006, Chester, United Kingdom. pp.70--84, ⟨10.1007/11780823_7⟩
Conference papers
hal-00342000v1
|
|
Algorithme distribué tricritère pour la construction de structures de connexionsActes des Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 2006, France. pp.45--48
Conference papers
hal-00341985v1
|
Distributed cost management in a selfish multi-operators BGP networkProceedings of the first EuroNGI Conference on Traffic Engineering for the Next Generation Internet, 2005, Italy. pp.24--30, ⟨10.1109/NGI.2005.1431643⟩
Conference papers
hal-00341996v1
|
|
Distributed Cost Management in a Selfish Multi-Operators BGP Network2005, pp.CD
Conference papers
hal-00126486v1
|
|
The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General GraphsIPDPS, 2003, Nice, France. pp.161
Conference papers
hal-01310359v1
|
|
The first Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General GraphIPDPS, 2003, France. pp.161 (résumé, article sur CDROM), ⟨10.1109/IPDPS.2003.1213299⟩
Conference papers
hal-00082562v1
|
|
An Improved Snap-Stabilizing {PIF} AlgorithmSSS, 2003, San Frisco, United States. ⟨10.1007/3-540-45032-7_15⟩
Conference papers
hal-01310823v1
|
|
|
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning TreeOPODIS 2001, 2001, France. pp.113-124
Conference papers
hal-00134604v1
|
|
Universal Loop-Free Super-Stabilization2010
Preprints, Working Papers, ...
hal-00492320v1
|
|
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
Reports
hal-00879578v1
|
|
Perpetual Graph Searching[Research Report] RR-7897, INRIA. 2012
Reports
hal-00675233v1
|
|
Exclusive perpetual ring exploration without chirality[Research Report] Université d'Evry Val d'Essonne. 2010, pp.17
Reports
inria-00464206v1
|
|
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property[Research Report] Université d'Evry Val d'Essonne. 2009
Reports
inria-00384041v1
|
|
On the Self-stabilization of Mobile Robots in Graphs[Research Report] RR-6266, INRIA. 2007, pp.23
Reports
inria-00166547v2
|
|
Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomesAlgorithme et structure de données [cs.DS]. Université Pierre et Marie Curie - Paris VI, 2011
Habilitation à diriger des recherches
tel-00847179v1
|