- A.; Davida, G.; Litow, B. (2001), "Division in logspace-uniform NC1",
RAIRO Theoretical Informatics and Applications, 35 (3): 259–276, doi:10.1051/ita:2001119...
- ISBN 978-3-642-22599-4. J. M.
Robson (1996), "Separating
words with
machines and groups",
RAIRO –
Informatique théorique et applications, 30 (1): 81–86,
retrieved 2012-07-15...
- "Nonuniform
complexity classes specified by
lower and
upper bounds" (PDF).
RAIRO –
Theoretical Informatics and
Applications –
Informatique Théorique et Applications...
- Kruszewski, P. (1996), "On the Horton–Strahler
number for
random tries",
RAIRO Informatique Théorique et Applications, 30 (5): 443–456, doi:10.1051/ita/1996300504431...
- Berstel, J.; Séébold, P. (1994). "A
remark on
morphic Sturmian words".
RAIRO, Inform. Théor. Appl. 2. 8 (3–4): 255–263. doi:10.1051/ita/1994283-402551...
- (2008), "A
hierarchy of
automatic ω-words
having a
decidable MSO theory",
RAIRO Theoretical Informatics and Applications, 42 (3): 417–450, doi:10.1051/ita:2008008...
-
trawling gear in
secret undersea cables (SOSUS). In 1975 the
Norwegian trawler Rairo reported snagging her nets on an
undersea obstruction in the area where...
- (April 2014). "A branch-and-cut for the Non-Disjoint m-Ring Star Problem".
RAIRO -
Operations Research. 48 (2): 167–188. doi:10.1051/ro/2014006. ISSN 0399-0559...
- "Nonuniform
complexity classes specified by
lower and
upper bounds" (PDF).
RAIRO –
Theoretical Informatics and
Applications –
Informatique Théorique et Applications...
- the com****tions on an
elliptic curve using addition-subtraction chains",
RAIRO Informatique théoretique et
application 24, pp. 531-543 (1990).
Donald E...
