An efficient certificateless multi-receiver threshold decryption scheme
RAIRO-Theor. Inf. Appl., 53 1-2 (2019) 67-84
Published online: 15 February 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
-
-
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 -
Expressive capacity of subregular expressions
RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 201-218Published online: 24 January 2019
| 16 |
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
|
| 9 |
Free Access
Une caractérisation des générateurs standardR.A.I.R.O. Informatique théorique, 8 R1 (1974) 63-83
Published online: 01 February 2017
|
| 6 |
Free Access
Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofiqueRAIRO-Theor. Inf. Appl., 29 2 (1995) 85-103
Published online: 01 February 2017
|
| 5 |
Free Access
Tours de Hanoï et automatesRAIRO-Theor. Inf. Appl., 24 1 (1990) 1-15
Published online: 01 February 2017
|
| 5 |
Free Access
A limit theorem for “quicksort”RAIRO-Theor. Inf. Appl., 25 1 (1991) 85-100
Published online: 01 February 2017
|
