Lélia Blin

483 total citations
15 papers, 75 citations indexed

About

Lélia Blin is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Management Science and Operations Research. According to data from OpenAlex, Lélia Blin has authored 15 papers receiving a total of 75 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computer Networks and Communications, 5 papers in Computational Theory and Mathematics and 2 papers in Management Science and Operations Research. Recurrent topics in Lélia Blin's work include Distributed systems and fault tolerance (8 papers), Optimization and Search Problems (7 papers) and Complexity and Algorithms in Graphs (3 papers). Lélia Blin is often cited by papers focused on Distributed systems and fault tolerance (8 papers), Optimization and Search Problems (7 papers) and Complexity and Algorithms in Graphs (3 papers). Lélia Blin collaborates with scholars based in France, Chile and Canada. Lélia Blin's co-authors include Nicolas Nisse, Sébastien Tixeuil, Sandrine Vial, Pierre Fraigniaud, Maria Potop-Butucaru, Pierre Fraigniaud, Swan Dubois, Éric Angel, David Ilcinkas and Evripidis Bampis and has published in prestigious journals such as Theoretical Computer Science, Journal of Parallel and Distributed Computing and Algorithmica.

In The Last Decade

Lélia Blin

12 papers receiving 73 citations

Peers

Lélia Blin

CNC

CTM

AI

EEE

ME

Swan Dubois France

Alessia Milani France

Pierre Fraigniaud France

J. Bieling Germany

Jonathan Bright United States

Alain Cournier France

Konstantinos Georgiou Canada

Sami Évangelista France

Siavosh Benabbas Canada

Steven Chaplick Germany

Swan Dubois France

Lélia Blin

65 ×1.0

CNC

12 ×0.6

CTM

6 ×0.6

AI

6 ×0.8

EEE

3 ×0.6

ME

Citations per year, relative to Lélia Blin Lélia Blin (= 1×) peers Swan Dubois

Countries citing papers authored by Lélia Blin

Since Specialization

Citations

This map shows the geographic impact of Lélia Blin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Lélia Blin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lélia Blin more than expected).

Fields of papers citing papers by Lélia Blin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Lélia Blin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Lélia Blin. The network helps show where Lélia Blin may publish in the future.

Co-authorship network of co-authors of Lélia Blin

This figure shows the co-authorship network connecting the top 25 collaborators of Lélia Blin. A scholar is included among the top collaborators of Lélia Blin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Lélia Blin. Lélia Blin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

15 of 15 papers shown

1.

Blin, Lélia, et al.. (2023). Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. Discrete Mathematics & Theoretical Computer Science. vol. 25:1(Distributed Computing and...).

2.

Blin, Lélia & Sébastien Tixeuil. (2020). Compact self-stabilizing leader election for general networks. Journal of Parallel and Distributed Computing. 144. 278–294. 2 indexed citations

3.

Blin, Lélia, et al.. (2019). Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. arXiv (Cornell University).

4.

Blin, Lélia, et al.. (2018). A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. Journal of Parallel and Distributed Computing. 117. 50–62. 2 indexed citations

5.

Blin, Lélia, Jurek Czyzowicz, David Ilcinkas, et al.. (2018). On asynchronous rendezvous in general graphs. Theoretical Computer Science. 753. 80–90. 2 indexed citations

6.

Blin, Lélia & Sébastien Tixeuil. (2017). Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distributed Computing. 31(2). 139–166. 9 indexed citations

7.

Blin, Lélia, et al.. (2016). Exclusive Graph Searching. Algorithmica. 77(3). 942–969. 2 indexed citations

8.

Blin, Lélia & Pierre Fraigniaud. (2014). Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes.. 565–566. 1 indexed citations

9.

Blin, Lélia, et al.. (2013). A super-stabilizinglog(n)-approximation algorithm for dynamic Steiner trees. Theoretical Computer Science. 500. 90–112. 5 indexed citations

10.

Blin, Lélia, et al.. (2010). Self-stabilizing minimum degree spanning tree within one from the optimal degree. Journal of Parallel and Distributed Computing. 71(3). 438–449. 7 indexed citations

11.

Blin, Lélia, Pierre Fraigniaud, Nicolas Nisse, & Sandrine Vial. (2008). Distributed chasing of network intruders. Theoretical Computer Science. 399(1-2). 12–37. 18 indexed citations

12.

Blin, Lélia, Pierre Fraigniaud, Nicolas Nisse, & Sandrine Vial. (2006). Distributed Chasing of Network Intruders by Mobile Agents. Theoretical Computer Science. 399. 7 indexed citations

13.

Angel, Éric, Evripidis Bampis, Lélia Blin, & Laurent Gourvès. (2006). Fair cost-sharing methods for the minimum spanning tree game. Information Processing Letters. 100(1). 29–35.

14.

Blin, Lélia, et al.. (2004). THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS. International Journal of Foundations of Computer Science. 15(3). 507–516. 13 indexed citations

15.

Blin, Lélia, et al.. (2003). The first Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graph. HAL (Le Centre pour la Communication Scientifique Directe). 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact