Journals
Seminars
Books
Lecture notes
Theses
Authors
OFF
Journals
Seminars
Books
Lecture notes
Theses
Authors
All
All
Author
Title
References
Keywords
Full text
Search
NOT
Between
and
Author
All
Author
Title
Date
References
Keywords
Full text
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Volume 27 (1993)
Issue no. 1
Table of Contents
Prescribed ultrametrics
Higgins, J.
;
Campbell, D.
p. 1-5
On the structure of recognizable languages of dependence graphs
Ehrenfeucht, A.
;
Hoogeboom, H. J.
;
Rozenberg, G.
p. 7-22
A fast algorithm to decide on the equivalence of stateless DPDA
Caucal, Didier
p. 23-48
Efficient reductions of picture words
Brandenburg, Franz J.
;
Dassow, Jürgen
p. 49-56
PCP-prime words and primality types
Mateescu, Alexandru
;
Salomaa, Arto
p. 57-70
On languages satisfying “interchange lemma”
Mitrana, Victor
p. 71-79
Issue no. 2
Table of Contents
An approach to parallel algorithm design
Georgakopoulos, G.
;
Stafylopatis, A.
p. 85-95
Real time recognition with cellular automata : a meaningful example
Terrier, V.
p. 97-120
Majoration de la norme des facteurs d'un polynôme : cas où toutes les racines du polynôme sont réelles
Glesser, P.
p. 121-134
On ranking 1-way finitely ambiguous NL languages and
#
P
1
-complete census functions
Bertoni, A.
;
Goldwurm, M.
p. 135-148
Holonomic functions and their relation to linearly constrained languages
Massazza, P.
p. 149-161
On searching for roots of a polynomial in a circular annulus
Saux Picart, Ph.
p. 163-172
Issue no. 3
Table of Contents
Limiting characterizations of low level space complexity classes
Angelaccio, Michèle
;
Protasi, Marco
p. 175-182
Objects in relational database schemes with functional, inclusion, and exclusion dependencies
Biskup, Joachim
;
Dublish, Pratul
p. 183-219
CPO-models for second order lambda calculus with recursive types and subtyping
Poll, E.
;
Hemerik, C.
;
Ten Eikelder, H. M. M.
p. 221-260
Pm numbers, ambiguity, and regularity
Cameron, H. A.
;
Wood, D.
p. 261-275
Issue no. 4
Table of Contents
On the positive and the inversion complexity of Boolean functions
Dičiūnas, V.
p. 283-293
Space-efficient parallel merging
Katajainen, J.
;
Levcopoulos, C.
;
Petersson, O.
p. 295-310
An economical transformation of graph grammars
Rudnicki, A.
p. 311-325
On the restricted equivalence for subclasses of propositional logic
Flögel, A.
;
Kleine Büning, H.
;
Lettmann, T.
p. 327-340
An algorithm to compute the möbius function of the rotation lattice of binary trees
Pallo, J. M.
p. 341-348
Sublogarithmic
∑
2
-space is not closed under complement and other separation results
Geffert, V.
p. 349-366
Performance considerations on a random graph model for parallel processing
Afrati, F.
;
Stafylopatis, A.
p. 367-388
Issue no. 5
Table of Contents
Fast diagnosis of multiprocessor systems with random faults
Diks, Krzysztof
;
Pelc, Andrzej
p. 391-401
Language classes defined by time-bounded relativised cellular automata
Mahajan, Meena
;
Krithivasan, Kamala
p. 403-432
Combinatorial properties of texts
Ehrenfeucht, A.
;
Ten Pas, P.
;
Rozenberg, G.
p. 433-464
Congestion optimale du plongement de l’hypercube
H
(
n
)
dans la chaîne
P
(
2
n
)
Bel Hala, A.
p. 465-481
Issue no. 6
Table of Contents
Autonomous posets and quantales
Mascari, G. F.
;
Pucci, F.
p. 483-501
An imperative language based on distributive categories II
Khalil, Wafaa
;
Walters, R. F. C.
p. 503-522
Retrieving library functions by unifying types modulo linear isomorphism
Rittri, M.
p. 523-540
On the average number of registers needed to evaluate a special class of backtrack trees
Trier, U.
p. 541-554
A unified approach to control problems in discrete event processes
Bergeron, A.
p. 555-573