On the length of uncompletable words in unambiguous automata
RAIRO-Theor. Inf. Appl., Publication ahead of print
Published online: 26 April 2019
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)
RAIRO: ITA is a section of RAIRO, Revue d'Automatique, d'Informatique et de Recherche Opérationnelle. RAIRO is an international journal devoted to high-level pure and applied research on the use of scientific methods and information processing in business and industry. Read more
-
-
An efficient certificateless multi-receiver threshold decryption scheme
RAIRO-Theor. Inf. Appl., 53 1-2 (2019) 67-84Published online: 15 February 2019 -
Uncountable classical and quantum complexity classes
RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 111-126Published online: 07 February 2019 -
Regular and linear permutation languages
RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 219-234Published online: 07 February 2019 -
Randomized generation of error control codes with automata and transducers
RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 169-184Published online: 29 January 2019 -
The complexity of concatenation on deterministic and alternating finite automata
RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 153-168Published online: 24 January 2019
| 8 |
Free Access
Speeding up the computations on an elliptic curve using addition-subtraction chainsRAIRO-Theor. Inf. Appl., 24 6 (1990) 531-543
Published online: 01 February 2017
|
| 8 |
Free Access
Pour en finir avec la dérécursivation du problème des tours de HanoïRAIRO-Theor. Inf. Appl., 24 1 (1990) 17-35
Published online: 01 February 2017
|
| 4 |
Free Access
Calculs d'invariants primitifs de groupes finisRAIRO-Theor. Inf. Appl., 33 1 (1999) 59-77
Published online: 15 August 2002
|
| 4 |
Free Access
Factorisation des polynômes à plusieurs variablesRAIRO. Inform. théor., 14 2 (1980) 209-223
Published online: 01 February 2017
|
| 4 |
Free Access
A limit theorem for “quicksort”RAIRO-Theor. Inf. Appl., 25 1 (1991) 85-100
Published online: 01 February 2017
|
