Theoretical Computer Science, Volume 86

Volume 86, Number 1, 1991

• Frank S. de Boer, Jan J. M. M. Rutten, Joost N. Kok, Catuscia Palamidessi: Semantic Models for Concurrent Logic Languages. 3-33 BibTeX
• Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop: An Analysis of Loop Checking Mechanisms for Logic Programs. 35-79 BibTeX
• Lawrence Cavedon: Acyclic Logic Programs and the Completeness of SLDNF-Resolution. 81-92 BibTeX
• Jorge Lobo, Arcot Rajasekar, Jack Minker: Semantics of Horn and Disjunctive Logic Programs. 93-106 BibTeX
• Hirohisa Seki: Unfold/Fold Transformations of Stratified Programs. 107-139 BibTeX , preliminary version: ICLP 1989: 554-568

Volume 86, Number 2, 1991

• Amir Averbuch, Zvi Galil, Shmuel Winograd: Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. Part II: The Algebra G[u]/<u^n>. 143-203 BibTeX
• Jean-Claude Spehner: Merging in Maps and in Pavings. 205-232 BibTeX
• Kosaburo Hashiguchi: Recognizable Closures and Submonoids of Free Partially Commutative Monoids. 233-241 BibTeX
• Marek Chrobak, David Eppstein: Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. 243-266 BibTeX
• Matthias Krause, Christoph Meinel, Stephan Waack: Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. 267-275 BibTeX Françoise Gire, M. Nivat: Langages algébriques de mots biinfinis. 277-323
• Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini: The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages. 325-342 BibTeX
• Carl-Johan H. Seger: On the Existence of Speed-Independent Circuits. 343-364 BibTeX
• Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro: Decoders with Initial State Invariance for Multivalued Encodings. 365-375 BibTeX
• Gyora M. Benedek, Alon Itai: Learnability with Respect to Fixed Distributions. 377-390 BibTeX