| Exclusive perpetual ring exploration without chirality L Blin, A Milani, M Potop-Butucaru, S Tixeuil International Symposium on Distributed Computing, 312-327, 2010 | 70 | 2010 |
| Distributed chasing of network intruders L Blin, P Fraigniaud, N Nisse, S Vial Theoretical Computer Science 399 (1-2), 12-37, 2008 | 45 | 2008 |
| Distributed chasing of network intruders L Blin, P Fraigniaud, N Nisse, S Vial Structural Information and Communication Complexity, 70-84, 2006 | 43 | 2006 |
| On proof-labeling schemes versus silent self-stabilizing algorithms L Blin, P Fraigniaud, B Patt-Shamir Symposium on Self-Stabilizing Systems, 18-32, 2014 | 42 | 2014 |
| Self-stabilizing minimum degree spanning tree within one from the optimal degree L Blin, MG Potop-Butucaru, S Rovedakis Journal of Parallel and Distributed Computing 71 (3), 438-449, 2011 | 37 | 2011 |
| An improved snap-stabilizing PIF algorithm L Blin, A Cournier, V Villain Symposium on Self-Stabilizing Systems, 199-214, 2003 | 36 | 2003 |
| Exclusive graph searching L Blin, J Burman, N Nisse Algorithmica 77 (3), 942-969, 2017 | 32* | 2017 |
| Loop-free super-stabilizing spanning tree construction L Blin, MG Potop-Butucaru, S Rovedakis, S Tixeuil Symposium on Self-Stabilizing Systems, 50-64, 2010 | 32 | 2010 |
| Compact Deterministic Self-stabilizing Leader Election L Blin, S Tixeuil International Symposium on Distributed Computing, 76-90, 2013 | 30* | 2013 |
| Space-optimal time-efficient silent self-stabilizing constructions of constrained spanning trees L Blin, P Fraigniaud 2015 IEEE 35th International Conference on Distributed Computing Systems …, 2015 | 29* | 2015 |
| A new self-stabilizing minimum spanning tree construction with loop-free property L Blin, M Potop-Butucaru, S Rovedakis, S Tixeuil International Symposium on Distributed Computing, 407-422, 2009 | 29 | 2009 |
| A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees L Blin, MG Potop-Butucaru, S Rovedakis Symposium on Self-Stabilizing Systems, 133-148, 2009 | 24* | 2009 |
| The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs L Blin, F Butelle International Journal of foundations of computer science 15 (03), 507-516, 2004 | 24 | 2004 |
| Fast self-stabilizing minimum spanning tree construction L Blin, S Dolev, MG Potop-Butucaru, S Rovedakis International Symposium on Distributed Computing, 480-494, 2010 | 23 | 2010 |
| Bounding degrees on RPL F Boubekeur, L Blin, R Leone, P Medagliani Proceedings of the 11th ACM Symposium on QoS and Security for Wireless and …, 2015 | 21 | 2015 |
| Distributed cost management in a selfish multi-operators BGP network D Barth, L Blin, L Echabbi, S Vial Next Generation Internet Networks, 2005, 24-30, 2005 | 21* | 2005 |
| A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon L Blin, F Boubekeur, S Dubois Journal of Parallel and Distributed Computing 117, 50-62, 2018 | 14 | 2018 |
| On the self-stabilization of mobile robots in graphs L Blin, M Gradinariu Potop-Butucaru, S Tixeuil International Conference On Principles Of Distributed Systems, 301-314, 2007 | 13 | 2007 |
| Distributed approximation allocation resources algorithm for connecting groups F Baille, L Blin, C Laforest European Conference on Parallel Processing, 519-529, 2006 | 9 | 2006 |
| Compact self-stabilizing leader election for general networks L Blin, S Tixeuil Latin American Symposium on Theoretical Informatics, 161-173, 2018 | 7 | 2018 |
Sebastien TixeuilProfessor of Computer Science, Sorbonne Université, LIP6 & IUFVerified email at lip6.fr
