0.5(top 50%)
impact factor
925(top 20%)
papers
6.9K(top 20%)
citations
34(top 20%)
h-index
0.5(top 50%)
impact factor
971
all documents
7.4K
doc citations
55(top 20%)
g-index
Top Articles
| # | Title | Journal | Year | Citations |
|---|---|---|---|---|
| 1 | Notes on finite asynchronous automata | RAIRO - Theoretical Informatics and Applications | 1987 | 184 |
| 2 | Speeding up the computations on an elliptic curve using addition-subtraction chains | RAIRO - Theoretical Informatics and Applications | 1990 | 168 |
| 3 | A limit theorem for “quicksort” | RAIRO - Theoretical Informatics and Applications | 1991 | 167 |
| 4 | Adhesive and quasiadhesive categories | RAIRO - Theoretical Informatics and Applications | 2005 | 137 |
| 5 | The complexity of the travelling repairman problem | RAIRO - Theoretical Informatics and Applications | 1986 | 119 |
| 6 | The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues | RAIRO - Theoretical Informatics and Applications | 1992 | 117 |
| 7 | Repetitions in the Fibonacci infinite word | RAIRO - Theoretical Informatics and Applications | 1992 | 88 |
| 8 | A sharpening of the Parikh mapping | RAIRO - Theoretical Informatics and Applications | 2001 | 86 |
| 9 | Learning deterministic regular grammars from stochastic samples in polynomial time | RAIRO - Theoretical Informatics and Applications | 1999 | 82 |
| 10 | Sur les automates circulaires et la conjecture de Černý | RAIRO - Theoretical Informatics and Applications | 1998 | 78 |
| 11 | A limiting distribution for quicksort | RAIRO - Theoretical Informatics and Applications | 1989 | 77 |
| 12 | The difference and truth-table hierarchies for NP | RAIRO - Theoretical Informatics and Applications | 1987 | 74 |
| 13 | Relationships among $PL$, $\#L$, and the determinant | RAIRO - Theoretical Informatics and Applications | 1996 | 73 |
| 14 | On semigroups of matrices over the tropical semiring | RAIRO - Theoretical Informatics and Applications | 1994 | 61 |
| 15 | On some packing problem related to dynamic storage allocation | RAIRO - Theoretical Informatics and Applications | 1988 | 61 |
| 16 | Division in logspace-uniformNC1 | RAIRO - Theoretical Informatics and Applications | 2001 | 60 |
| 17 | Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study | RAIRO - Theoretical Informatics and Applications | 2001 | 59 |
| 18 | Return words in Sturmian and episturmian words | RAIRO - Theoretical Informatics and Applications | 2000 | 58 |
| 19 | Normal forms for phrase-structure grammars | RAIRO - Theoretical Informatics and Applications | 1991 | 58 |
| 20 | Theμ-calculus alternation-depth hierarchy is strict on binary trees | RAIRO - Theoretical Informatics and Applications | 1999 | 55 |
| 21 | Analysis of quickselect : an algorithm for order statistics | RAIRO - Theoretical Informatics and Applications | 1995 | 52 |
| 22 | On the equivalence of linear conjunctive grammars and trellis automata | RAIRO - Theoretical Informatics and Applications | 2004 | 52 |
| 23 | Exact and asymptotic distributions in digital and binary search trees | RAIRO - Theoretical Informatics and Applications | 1987 | 51 |
| 24 | Probabilistic operational semantics for the lambda calculus | RAIRO - Theoretical Informatics and Applications | 2012 | 49 |
| 25 | Permissive strategies: from parity games to safety games | RAIRO - Theoretical Informatics and Applications | 2002 | 47 |
| 26 | Decidability of periodicity for infinite words | RAIRO - Theoretical Informatics and Applications | 1986 | 47 |
| 27 | On generating all solutions of generalized satisfiability problems | RAIRO - Theoretical Informatics and Applications | 1997 | 47 |
| 28 | On the periodicity of morphisms on free monoids | RAIRO - Theoretical Informatics and Applications | 1986 | 46 |
| 29 | Episturmian words: a survey | RAIRO - Theoretical Informatics and Applications | 2009 | 45 |
| 30 | Each regular code is included in a maximal regular code | RAIRO - Theoretical Informatics and Applications | 1986 | 43 |
| 31 | Combinatorial analysis of quicksort algorithm | RAIRO - Theoretical Informatics and Applications | 1989 | 43 |
| 32 | Measuring the problem-relevant information in input | RAIRO - Theoretical Informatics and Applications | 2009 | 43 |
| 33 | Graphes canoniques de graphes algébriques | RAIRO - Theoretical Informatics and Applications | 1990 | 40 |
| 34 | Une remarque sur les systèmes complets d'identités rationnelles | RAIRO - Theoretical Informatics and Applications | 1990 | 37 |
| 35 | Implementing term rewriting by jungle evaluation | RAIRO - Theoretical Informatics and Applications | 1991 | 37 |
| 36 | A decision method for the recognizability of sets defined by number systems | RAIRO - Theoretical Informatics and Applications | 1986 | 36 |
| 37 | Distance desert automata and the star height problem | RAIRO - Theoretical Informatics and Applications | 2005 | 35 |
| 38 | State complexity of cyclic shift | RAIRO - Theoretical Informatics and Applications | 2008 | 35 |
| 39 | A generator of morphisms for infinite words | RAIRO - Theoretical Informatics and Applications | 2006 | 34 |
| 40 | Spécialisation de la suite de Sturm et sous-résultants (I) | RAIRO - Theoretical Informatics and Applications | 1990 | 34 |
| 41 | Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time | RAIRO - Theoretical Informatics and Applications | 2000 | 33 |
| 42 | Polynomials over the reals in proofs of termination : from theory to practice | RAIRO - Theoretical Informatics and Applications | 2005 | 33 |
| 43 | Termination checking with types | RAIRO - Theoretical Informatics and Applications | 2004 | 33 |
| 44 | On a paper by Castelli, Mignosi, Restivo | RAIRO - Theoretical Informatics and Applications | 2000 | 32 |
| 45 | On frontiers of regular trees | RAIRO - Theoretical Informatics and Applications | 1986 | 32 |
| 46 | Advice Complexity and Barely Random Algorithms | RAIRO - Theoretical Informatics and Applications | 2011 | 32 |
| 47 | On Christoffel classes | RAIRO - Theoretical Informatics and Applications | 2006 | 31 |
| 48 | On infinitary finite length codes | RAIRO - Theoretical Informatics and Applications | 1986 | 31 |
| 49 | Completing codes | RAIRO - Theoretical Informatics and Applications | 1989 | 31 |
| 50 | Codes et motifs | RAIRO - Theoretical Informatics and Applications | 1989 | 31 |