Information and Computation, Volume 101

Volume 101, Number 1, 1992

• Elias Dahlhaus, Johann A. Makowsky: Query Languages for Hierarchic Databases. 1-32 BibTeX
• Rakesh M. Verma, I. V. Ramakrishnan: Tight Complexity Bounds for Term Matching Problems. 33-69 BibTeX
• Jan Stransky: A Lattice for Abstract Interpretation of Dynamic (LISP-Like) Structures. 70-102 BibTeX
• Dimiter Vakarelov: A Modal Logic for Cyclic Repeating. 103-122 BibTeX
• Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig: k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs. 123-129 BibTeX

Volume 101, Number 2, 1992

• Kosaburo Hashiguchi, Kazuya Yamada: String Matching Problems over Free Partially Commutative Monoids. 131-149 BibTeX
• Raymond T. Ng, V. S. Subrahmanian: Probabilistic Logic Programming. 150-201 BibTeX
• Andreas Goerdt: Characterizing Complexity Classes by General Recursive Definitions in Higher Types. 202-218 BibTeX
• Jean-Eric Pin, Howard Straubing, Denis Thérien: Some Results on the Generalized Star-Height Problem. 219-250 BibTeX
• Daniel J. Dougherty: Adding Algebraic Rewriting to the Untyped Lambda Calculus. 251-267 BibTeX