Tome 23 (1989) no. 2

Sommaire

Completing codes
p. 135-147
Disjunctive languages and compatible orders
p. 149-163
An application of m-ary trees to the design of data structures for geometric searching problems
p. 165-176
Nonuniform complexity classes specified by lower and upper bounds
p. 177-194
Production en temps réel et complexité de structure de suites infinies
p. 195-216
A normal form for restricted exponential functions
p. 217-231