RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 27 (1993) 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

\sum_{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