The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lélia Blin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Fabien Baille, Lélia Blin, Christian Laforest
    Distributed Approximation Allocation Resources Algorithm for Connecting Groups. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2006, pp:519-529 [Conf]
  2. Lélia Blin, Franck Butelle
    The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:161- [Conf]
  3. Lélia Blin, Franck Butelle
    A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2001, pp:113-124 [Conf]
  4. Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
    Distributed Chasing of Network Intruders. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:70-84 [Conf]
  5. Lélia Blin, Alain Cournier, Vincent Villain
    An Improved Snap-Stabilizing PIF Algorithm. [Citation Graph (0, 0)][DBLP]
    Self-Stabilizing Systems, 2003, pp:199-214 [Conf]
  6. Lélia Blin, Franck Butelle
    The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:3, pp:507-516 [Journal]
  7. Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès
    Fair cost-sharing methods for the minimum spanning tree game. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:1, pp:29-35 [Journal]
  8. Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
    On the Self-stabilization of Mobile Robots in Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  9. Self-stabilizing minimum-degree spanning tree within one from the optimal degree. [Citation Graph (, )][DBLP]


  10. On the Self-stabilization of Mobile Robots in Graphs. [Citation Graph (, )][DBLP]


  11. A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees. [Citation Graph (, )][DBLP]


  12. Loop-Free Super-Stabilizing Spanning Tree Construction. [Citation Graph (, )][DBLP]


  13. A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. [Citation Graph (, )][DBLP]


  14. Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme. [Citation Graph (, )][DBLP]


  15. Exclusive Perpetual Ring Exploration without Chirality. [Citation Graph (, )][DBLP]


  16. A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees [Citation Graph (, )][DBLP]


  17. A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property [Citation Graph (, )][DBLP]


  18. Universal Loop-Free Super-Stabilization [Citation Graph (, )][DBLP]


  19. Fast Self-Stabilizing Minimum Spanning Tree Construction [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002