RAIRO - Theoretical Informatics and Applications

Title Publication Date Language Citations
A limit theorem for “quicksort”1991/01/01116
The complexity of the travelling repairman problem1986/01/0177
A limiting distribution for quicksort1989/01/0171
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues1992/01/0168
Notes on finite asynchronous automata1987/01/0163
Speeding up the computations on an elliptic curve using addition-subtraction chains1990/01/0162
A sharpening of the Parikh mapping2001/11/0161
Adhesive and quasiadhesive categories2005/07/0161
Repetitions in the Fibonacci infinite word1992/01/0151
The difference and truth-table hierarchies for NP1987/01/0144
Return words in Sturmian and episturmian words2000/09/0144
Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study2001/01/0139
Sur les automates circulaires et la conjecture de Černý1998/01/0139
On some packing problem related to dynamic storage allocation1988/01/0134
Analysis of quickselect : an algorithm for order statistics1995/01/0133
Decidability of periodicity for infinite words1986/01/0133
On semigroups of matrices over the tropical semiring1994/01/0133
Episturmian words: a survey2009/03/0631
Exact and asymptotic distributions in digital and binary search trees1987/01/0131
Normal forms for phrase-structure grammars1991/01/0131
Division in logspace-uniformNC12001/05/0130
On the equivalence of linear conjunctive grammars and trellis automata2004/01/0130
Each regular code is included in a maximal regular code1986/01/0127
On the periodicity of morphisms on free monoids1986/01/0126
Completing codes1989/01/0125
Episturmian morphisms and a Galois theorem on continued fractions2005/01/0125
On a paper by Castelli, Mignosi, Restivo2000/09/0124
Probabilistic operational semantics for the lambda calculus2012/06/2224
Relationships among $PL$, $\#L$, and the determinant1996/01/0124
Combinatorial analysis of quicksort algorithm1989/01/0123