Остановите войну!
for scientists:
default search action
Lélia Blin
- > Home > Persons > Lélia Blin
Publications
- 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) - 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) - 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) - [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) - 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
- [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) - 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) - 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)
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 2023-09-27 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint