default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLélia Blin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Lélia Blin, Anaïs Durand, Sébastien Tixeuil:
Resource efficient stabilization for local tasks despite unknown capacity links. Theor. Comput. Sci. 1013: 114744 (2024)- [c28]Lélia Blin, Gabriel Le Bouder, Franck Petit:
Optimal Memory Requirement for Self-stabilizing Token Circulation. SIROCCO 2024: 101-118 - 2023
- [j13]Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. 25 (2023) - 2022
- [c27]Lélia Blin, Colette Johnen
, Gabriel Le Bouder, Franck Petit:
Silent Anonymous Snap-Stabilizing Termination Detection. SRDS 2022: 156-165 - 2021
- [c26]Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. OPODIS 2021: 24:1-24:12 - 2020
- [j12]Lélia Blin, Sébastien Tixeuil:
Compact self-stabilizing leader election for general networks. J. Parallel Distributed Comput. 144: 278-294 (2020) - [c25]Lélia Blin, Swan Dubois, Laurent Feuilloley:
Silent MST Approximation for Tiny Memory. SSS 2020: 118-132 - [i13]Lélia Blin, Anaïs Durand, Sébastien Tixeuil:
Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links. CoRR abs/2002.05382 (2020)
2010 – 2019
- 2019
- [j11]Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil:
On asynchronous rendezvous in general graphs. Theor. Comput. Sci. 753: 80-90 (2019) - [c24]Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Brief Announcement: Memory Lower Bounds for Self-Stabilization. DISC 2019: 37:1-37:3 - [i12]Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Memory Lower Bounds for Self-Stabilization. CoRR abs/1905.08563 (2019) - [i11]Lélia Blin, Swan Dubois, Laurent Feuilloley:
Silent MST approximation for tiny memory. CoRR abs/1905.08565 (2019) - 2018
- [j10]Lélia Blin, Sébastien Tixeuil:
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distributed Comput. 31(2): 139-166 (2018) - [j9]Lélia Blin, Fadwa Boubekeur, Swan Dubois:
A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. J. Parallel Distributed Comput. 117: 50-62 (2018) - [c23]Lélia Blin, Sébastien Tixeuil:
Compact Self-Stabilizing Leader Election for General Networks. LATIN 2018: 161-173 - 2017
- [j8]Lélia Blin, Janna Burman, Nicolas Nisse:
Exclusive Graph Searching. Algorithmica 77(3): 942-969 (2017) - [c22]Lélia Blin, Sébastien Tixeuil:
Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs. DISC 2017: 43:1-43:3 - [i10]Lélia Blin, Sébastien Tixeuil:
Compact Self-Stabilizing Leader Election for Arbitrary Networks. CoRR abs/1702.07605 (2017) - 2016
- [j7]Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property. Comput. J. 59(2): 225-243 (2016) - 2015
- [c21]Lélia Blin, Pierre Fraigniaud:
Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees. ICDCS 2015: 589-598 - [c20]Lélia Blin, Fadwa Boubekeur, Swan Dubois:
A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon. IPDPS 2015: 1065-1074 - [c19]Fadwa Boubekeur, Lélia Blin, Rémy Léone, Paolo Medagliani:
Bounding Degrees on RPL. Q2SWinet@MSWiM 2015: 123-130 - 2014
- [c18]Lélia Blin, Pierre Fraigniaud, Boaz Patt-Shamir:
On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms. SSS 2014: 18-32 - [c17]Lélia Blin, Pierre Fraigniaud:
Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes. DISC 2014: 565-566 - [i9]Lélia Blin, Sébastien Tixeuil:
Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative. CoRR abs/1401.4972 (2014) - [i8]Lélia Blin, Pierre Fraigniaud:
Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction. CoRR abs/1402.2496 (2014) - 2013
- [j6]Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis:
A super-stabilizing log(n)log(n)-approximation algorithm for dynamic Steiner trees. Theor. Comput. Sci. 500: 90-112 (2013) - [c16]Lélia Blin, Janna Burman, Nicolas Nisse:
Exclusive Graph Searching. ESA 2013: 181-192 - [c15]Lélia Blin, Sébastien Tixeuil:
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits. PODC 2013: 125-127 - [c14]Lélia Blin, Sébastien Tixeuil:
Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative. DISC 2013: 76-90 - [i7]Lélia Blin:
Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes. CoRR abs/1310.2494 (2013) - [i6]Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme. CoRR abs/1311.0798 (2013) - 2012
- [c13]Lélia Blin, Janna Burman, Nicolas Nisse:
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching. DISC 2012: 403-404 - [e1]Lélia Blin, Yann Busnel:
4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, TADDS '12, Roma, Italy, December 17, 2012. ACM 2012, ISBN 978-1-4503-1849-5 [contents] - 2011
- [b1]Lélia Blin:
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). Pierre and Marie Curie University, Paris, France, 2011 - [j5]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
Self-stabilizing minimum degree spanning tree within one from the optimal degree. J. Parallel Distributed Comput. 71(3): 438-449 (2011) - 2010
- [j4]Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault:
Hardness Results and Heuristic for Multi-groups Interconnection. Comput. J. 53(9): 1497-1507 (2010) - [c12]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
Loop-Free Super-Stabilizing Spanning Tree Construction. SSS 2010: 50-64 - [c11]Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil:
Exclusive Perpetual Ring Exploration without Chirality. DISC 2010: 312-327 - [c10]Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme. DISC 2010: 480-494 - [i5]Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
Universal Loop-Free Super-Stabilization. CoRR abs/1006.3009 (2010) - [i4]Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis:
Fast Self-Stabilizing Minimum Spanning Tree Construction. CoRR abs/1006.3141 (2010)
2000 – 2009
- 2009
- [c9]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
Self-stabilizing minimum-degree spanning tree within one from the optimal degree. IPDPS 2009: 1-11 - [c8]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees. SSS 2009: 133-148 - [c7]Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. DISC 2009: 407-422 - [i3]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees. CoRR abs/0902.3528 (2009) - [i2]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property. CoRR abs/0905.2287 (2009) - 2008
- [j3]Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial:
Distributed chasing of network intruders. Theor. Comput. Sci. 399(1-2): 12-37 (2008) - 2007
- [c6]Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
On the Self-stabilization of Mobile Robots in Graphs. OPODIS 2007: 301-314 - [i1]Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
On the Self-stabilization of Mobile Robots in Graphs. CoRR abs/0708.0909 (2007) - 2006
- [j2]Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès:
Fair cost-sharing methods for the minimum spanning tree game. Inf. Process. Lett. 100(1): 29-35 (2006) - [c5]Fabien Baille, Lélia Blin, Christian Laforest:
Distributed Approximation Allocation Resources Algorithm for Connecting Groups. Euro-Par 2006: 519-529 - [c4]Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial:
Distributed Chasing of Network Intruders. SIROCCO 2006: 70-84 - 2004
- [j1]Lélia Blin, Franck Butelle:
The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs. Int. J. Found. Comput. Sci. 15(3): 507-516 (2004) - 2003
- [c3]Lélia Blin, Franck Butelle:
The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. IPDPS 2003: 161 - [c2]Lélia Blin, Alain Cournier, Vincent Villain:
An Improved Snap-Stabilizing PIF Algorithm. Self-Stabilizing Systems 2003: 199-214 - 2001
- [c1]Lélia Blin, Franck Butelle:
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. OPODIS 2001: 113-124
Coauthor Index
aka: Maria Gradinariu Potop-Butucaru
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
