RAIRO - Theoretical Informatics and Applications

Free Access

On the positive and the inversion complexity of Boolean functions p. 283

V. Dičiūnas

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1993270402831

• Abstract
• PDF (868 KB)
• References

Free Access

Space-efficient parallel merging p. 295

J. Katajainen, C. Levcopoulos and O. Petersson

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1993270402951

• Abstract
• PDF (1.43 MB)
• References

Free Access

An economical transformation of graph grammars p. 311

A. Rudnicki

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1993270403111

• Abstract
• PDF (966 KB)
• References

Free Access

On the restricted equivalence for subclasses of propositional logic p. 327

A. Flögel, H. Kleine Büning and T. Lettmann

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1993270403271

• Abstract
• PDF (1.18 MB)
• References

Free Access

An algorithm to compute the möbius function of the rotation lattice of binary trees p. 341

J. M. Pallo

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1993270403411

• Abstract
• PDF (628 KB)
• References

Free Access

Sublogarithmic $\sum _2$-space is not closed under complement and other separation results p. 349

V. Geffert

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1993270403491

• Abstract
• PDF (1.32 MB)
• References

Free Access

Performance considerations on a random graph model for parallel processing p. 367

F. Afrati and A. Stafylopatis

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1993270403671

• Abstract
• PDF (1.41 MB)
• References