Lélia Blin - RankMe

60 papers A* 1A 14B 7C 4Journal 29Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Deterministic Self-Stabilizing BFS Construction in Constant Space. CoRR Lélia Blin, Franck Petit, Sébastien Tixeuil
2025	A	`conf`	Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space Complexity. DISC Lélia Blin, Franck Petit, Sébastien Tixeuil
2025	J	`jnl`	Silent anonymous snap-stabilizing termination detection. Distributed Comput. Lélia Blin, Colette Johnen, Gabriel Le Bouder, Franck Petit
2024	B	`conf`	Optimal Memory Requirement for Self-stabilizing Token Circulation. SIROCCO Lélia Blin, Gabriel Le Bouder, Franck Petit
2024	J	`jnl`	Resource efficient stabilization for local tasks despite unknown capacity links. Theor. Comput. Sci. Lélia Blin, Anaïs Durand, Sébastien Tixeuil
2023	J	`jnl`	Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2022	B	`conf`	Silent Anonymous Snap-Stabilizing Termination Detection. SRDS Lélia Blin, Colette Johnen, Gabriel Le Bouder, Franck Petit
2021	B	`conf`	Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. OPODIS Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2020	J	`jnl`	Compact self-stabilizing leader election for general networks. J. Parallel Distributed Comput. Lélia Blin, Sébastien Tixeuil
2020	J	`jnl`	Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links. CoRR Lélia Blin, Anaïs Durand, Sébastien Tixeuil
2020	C	`conf`	Silent MST Approximation for Tiny Memory. SSS Lélia Blin, Swan Dubois, Laurent Feuilloley
2019	A	`conf`	Brief Announcement: Memory Lower Bounds for Self-Stabilization. DISC Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2019	J	`jnl`	Memory Lower Bounds for Self-Stabilization. CoRR Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2019	J	`jnl`	On asynchronous rendezvous in general graphs. Theor. Comput. Sci. Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil
2019	J	`jnl`	Silent MST approximation for tiny memory. CoRR Lélia Blin, Swan Dubois, Laurent Feuilloley
2018	J	`jnl`	A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. J. Parallel Distributed Comput. Lélia Blin, Fadwa Boubekeur, Swan Dubois
2018	B	`conf`	Compact Self-Stabilizing Leader Election for General Networks. LATIN Lélia Blin, Sébastien Tixeuil
2018	J	`jnl`	Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distributed Comput. Lélia Blin, Sébastien Tixeuil
2017	A	`conf`	Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs. DISC Lélia Blin, Sébastien Tixeuil
2017	J	`jnl`	Compact Self-Stabilizing Leader Election for Arbitrary Networks. CoRR Lélia Blin, Sébastien Tixeuil
2017	J	`jnl`	Exclusive Graph Searching. Algorithmica Lélia Blin, Janna Burman, Nicolas Nisse
2016	J	`jnl`	A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property. Comput. J. Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil
2015	A	`conf`	A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon. IPDPS Lélia Blin, Fadwa Boubekeur, Swan Dubois
2015	—	`conf`	Bounding Degrees on RPL. Q2SWinet@MSWiM Fadwa Boubekeur, Lélia Blin, Rémy Léone, Paolo Medagliani
2015	A	`conf`	Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees. ICDCS Lélia Blin, Pierre Fraigniaud
2014	J	`jnl`	Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative. CoRR Lélia Blin, Sébastien Tixeuil
2014	C	`conf`	On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms. SSS Lélia Blin, Pierre Fraigniaud, Boaz Patt-Shamir
2014	J	`jnl`	Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction. CoRR Lélia Blin, Pierre Fraigniaud
2014	A	`conf`	Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes. DISC Lélia Blin, Pierre Fraigniaud
2013	J	`jnl`	A super-stabilizing log( Theor. Comput. Sci. Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis
2013	J	`jnl`	Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes. CoRR Lélia Blin
2013	A*	`conf`	Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits. PODC Lélia Blin, Sébastien Tixeuil
2013	A	`conf`	Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative. DISC Lélia Blin, Sébastien Tixeuil
2013	A	`conf`	Exclusive Graph Searching. ESA Lélia Blin, Janna Burman, Nicolas Nisse
2013	J	`jnl`	Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme. CoRR Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
2012	—	`ed.`	4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, TADDS '12, Roma, Italy, December 17, 2012 TADDS Lélia Blin, Yann Busnel
2012	A	`conf`	Brief Announcement: Distributed Exclusive and Perpetual Tree Searching. DISC Lélia Blin, Janna Burman, Nicolas Nisse
2011	—	`book`	Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes. (Self-stabilizing algorithms for spanning tree construction and for the management of mobile entities). Lélia Blin
2011	J	`jnl`	Self-stabilizing minimum degree spanning tree within one from the optimal degree. J. Parallel Distributed Comput. Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
2010	A	`conf`	Exclusive Perpetual Ring Exploration without Chirality. DISC Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil
2010	J	`jnl`	Fast Self-Stabilizing Minimum Spanning Tree Construction CoRR Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis
2010	A	`conf`	Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme. DISC Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
2010	J	`jnl`	Hardness Results and Heuristic for Multi-groups Interconnection. Comput. J. Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault
2010	C	`conf`	Loop-Free Super-Stabilizing Spanning Tree Construction. SSS Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil
2010	J	`jnl`	Universal Loop-Free Super-Stabilization CoRR Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil
2009	J	`jnl`	A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property CoRR Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil
2009	A	`conf`	A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. DISC Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil
2009	J	`jnl`	A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees CoRR Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
2009	C	`conf`	A Superstabilizing log( SSS Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
2009	A	`conf`	Self-stabilizing minimum-degree spanning tree within one from the optimal degree. IPDPS Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
2008	J	`jnl`	Distributed chasing of network intruders. Theor. Comput. Sci. Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
2007	J	`jnl`	On the Self-stabilization of Mobile Robots in Graphs CoRR Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
2007	B	`conf`	On the Self-stabilization of Mobile Robots in Graphs. OPODIS Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
2006	—	`conf`	Distributed Approximation Allocation Resources Algorithm for Connecting Groups. Euro-Par Fabien Baille, Lélia Blin, Christian Laforest
2006	B	`conf`	Distributed Chasing of Network Intruders. SIROCCO Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
2006	J	`jnl`	Fair cost-sharing methods for the minimum spanning tree game. Inf. Process. Lett. Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès
2004	J	`jnl`	The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs. Int. J. Found. Comput. Sci. Lélia Blin, Franck Butelle
2003	—	`conf`	An Improved Snap-Stabilizing PIF Algorithm. Self-Stabilizing Systems Lélia Blin, Alain Cournier, Vincent Villain
2003	A	`conf`	The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. IPDPS Lélia Blin, Franck Butelle
2001	B	`conf`	A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. OPODIS Lélia Blin, Franck Butelle