JCSS, Volume 42

Volume 42, Number 1, February 1991

• Manfred Broy, Christian Lengauer: On Denotational versus Predicative Semantics. 1-29
• Eric Bach: Realistic Analysis of Some Randomized Algorithms. 30-53
• Jia-Huai You: Unification Modulo an Equality Theory for Equational Logic Programming. 54-75
• Richard Beigel: Relativized Counting Classes: Relations among Thresholds, Parity, and Mods. 76-96
• Hans L. Bodlaender: Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors. 97-118
• Ming Li, Yaacov Yesha: Resource Bounds for Parallel Computation of Threshold and Symmetric Functions. 119-137

Volume 42, Number 2, April 1991

• Elio Giovannetti, Giorgio Levi, Corrado Moiso, Catuscia Palamidessi: Kernel-LEAF: A Logic plus Functional Language. 139-185
• Friedrich Otto, Celia Wrathall: Overlaps in Free Partially Commutative Monoids. 186-198
• Jeffrey F. Naughton: One-Sided Recursions. 199-236
• Max H. Garzon, Yechezkel Zalcstein: On Isomorphism Testing of a Class of 2-Nilpotent Groups. 237-248
• Herbert Edelsbrunner, Leonidas J. Guibas: Corrigendum: Topologically Sweeping an Arrangement. 249-251 , ->JCSS 38(1): 165-194 (1989)

Volume 42, Number 3, June 1991

• Pavol Duris, Zvi Galil: Two Lower Bounds in Asynchronous Distributed Computation. 254-266
• Andrew Chi-Chih Yao: Lower Bounds to Randomized Algorithms for Graph Properties. 267-287
• Arkady Kanevsky, Vijaya Ramachandran: Improved Algorithms for Graph Four-Connectivity. 288-306
• Abhiram G. Ranade: How to Emulate Shared Memory. 307-326
• William Aiello, Johan Håstad: Statistical Zero-Knowledge Languages can be Recognized in Two Rounds. 327-345
• Yuri Gurevich: Average Case Completeness. 346-398