F. Blanchet-Sadri

1.1k total citations
78 papers, 484 citations indexed

About

F. Blanchet-Sadri is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, F. Blanchet-Sadri has authored 78 papers receiving a total of 484 indexed citations (citations by other indexed papers that have themselves been cited), including 78 papers in Computational Theory and Mathematics, 66 papers in Artificial Intelligence and 39 papers in Molecular Biology. Recurrent topics in F. Blanchet-Sadri's work include semigroups and automata theory (76 papers), Algorithms and Data Compression (50 papers) and DNA and Biological Computing (39 papers). F. Blanchet-Sadri is often cited by papers focused on semigroups and automata theory (76 papers), Algorithms and Data Compression (50 papers) and DNA and Biological Computing (39 papers). F. Blanchet-Sadri collaborates with scholars based in United States, Spain and Canada. F. Blanchet-Sadri's co-authors include Robert Mercaş, Carroll Morgan, Sean Simmons, Narad Rampersad, Daniel Seita, Travis Mandel, Kun Chen, Naomi C. Brownstein, William Severa and T.D. Howell and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and Computers & Mathematics with Applications.

In The Last Decade

F. Blanchet-Sadri

69 papers receiving 439 citations

Peers

F. Blanchet-Sadri
Jean-Marc Champarnaud France
Michel Latteux France
Géraud Sénizergues France
H. J. Shyr Taiwan
Dietrich Kuske Germany
Wojciech Plandowski Poland
Kosaburo Hashiguchi Japan
Narad Rampersad Canada
Arturo Carpi Italy
Pascal Weil France
Jean-Marc Champarnaud France
F. Blanchet-Sadri
Citations per year, relative to F. Blanchet-Sadri F. Blanchet-Sadri (= 1×) peers Jean-Marc Champarnaud

Countries citing papers authored by F. Blanchet-Sadri

Since Specialization
Citations

This map shows the geographic impact of F. Blanchet-Sadri'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 F. Blanchet-Sadri with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites F. Blanchet-Sadri more than expected).

Fields of papers citing papers by F. Blanchet-Sadri

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by F. Blanchet-Sadri. 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 F. Blanchet-Sadri. The network helps show where F. Blanchet-Sadri may publish in the future.

Co-authorship network of co-authors of F. Blanchet-Sadri

This figure shows the co-authorship network connecting the top 25 collaborators of F. Blanchet-Sadri. A scholar is included among the top collaborators of F. Blanchet-Sadri 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 F. Blanchet-Sadri. F. Blanchet-Sadri is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Blanchet-Sadri, F., et al.. (2017). Border correlations, lattices, and the subgraph component polynomial. European Journal of Combinatorics. 68. 204–222. 1 indexed citations
2.
Balkanski, Eric, et al.. (2015). On the state complexity of partial word DFAs. Theoretical Computer Science. 578. 2–12. 1 indexed citations
3.
Blanchet-Sadri, F., et al.. (2015). Computing minimum length representations of sets of words of uniform length. Theoretical Computer Science. 596. 41–54.
4.
Blanchet-Sadri, F., et al.. (2014). Squares in partial words. Theoretical Computer Science. 530. 42–57. 2 indexed citations
5.
Blanchet-Sadri, F., et al.. (2013). Strict bounds for pattern avoidance. Theoretical Computer Science. 506. 17–28. 5 indexed citations
6.
Blanchet-Sadri, F., et al.. (2013). Computing the partial word avoidability indices of ternary patterns. Journal of Discrete Algorithms. 23. 119–142. 1 indexed citations
7.
Blanchet-Sadri, F., et al.. (2012). Periodicity algorithms and a conjecture on overlaps in partial words. Theoretical Computer Science. 443. 35–45. 2 indexed citations
8.
Blanchet-Sadri, F., et al.. (2012). Constructing partial words with subword complexities not achievable by full words. Theoretical Computer Science. 432. 21–27. 1 indexed citations
9.
Blanchet-Sadri, F., et al.. (2011). Abelian repetitions in partial words. Advances in Applied Mathematics. 48(1). 194–214. 4 indexed citations
10.
Blanchet-Sadri, F., Bob Chen, & Aleksandar Chakarov. (2011). Number of holes in unavoidable sets of partial words I. Journal of Discrete Algorithms. 14. 55–64.
11.
Blanchet-Sadri, F., et al.. (2010). On the complexity of deciding avoidability of sets of partial words. Theoretical Computer Science. 411(49). 4263–4271. 3 indexed citations
12.
Blanchet-Sadri, F., et al.. (2008). Counting Distinct Squares in Partial Words.. 13(1). 122–133. 6 indexed citations
13.
Blanchet-Sadri, F., et al.. (2007). Fine and Wilf's Periodicity Result on Partial Words and Consequences.. 115–126. 1 indexed citations
14.
Blanchet-Sadri, F., et al.. (2007). Partial words and the critical factorization theorem revisited. Theoretical Computer Science. 385(1-3). 179–192. 4 indexed citations
15.
Blanchet-Sadri, F.. (2003). A periodicity result of partial words with one hole. Computers & Mathematics with Applications. 46(5-6). 813–820. 9 indexed citations
16.
Blanchet-Sadri, F., et al.. (2002). Conjugacy on partial words. Theoretical Computer Science. 289(1). 297–312. 15 indexed citations
17.
Blanchet-Sadri, F. & Carroll Morgan. (2001). Multiset and set decipherable codes. Computers & Mathematics with Applications. 41(10-11). 1257–1262. 16 indexed citations
18.
Blanchet-Sadri, F.. (1998). Trees, congruences and varieties of finite semigroups. Discrete Applied Mathematics. 86(2-3). 157–179. 1 indexed citations
19.
Blanchet-Sadri, F.. (1995). Some Logical Characterizations of the Dot-Depth Hierarchy and Applications. Journal of Computer and System Sciences. 51(2). 324–337. 9 indexed citations
20.
Blanchet-Sadri, F.. (1994). Equations and monoid varieties of dot-depth one and two. Theoretical Computer Science. 123(2). 239–258. 20 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

Breakdown of academic impact, for papers by Jean-Marc Champarnaud Breakdown of academic impact, for papers by Michel Latteux Breakdown of academic impact, for papers by Géraud Sénizergues Breakdown of academic impact, for papers by H. J. Shyr Breakdown of academic impact, for papers by Dietrich Kuske Breakdown of academic impact, for papers by Wojciech Plandowski Breakdown of academic impact, for papers by Kosaburo Hashiguchi Breakdown of academic impact, for papers by Narad Rampersad Breakdown of academic impact, for papers by Arturo Carpi Breakdown of academic impact, for papers by Pascal Weil
Rankless by CCL
2026