JCSS
, Volume 42
Volume 42, Number 1, February 1991
Manfred Broy
,
Christian Lengauer
: On Denotational versus Predicative Semantics. 1-29
BibTeX
Eric Bach
: Realistic Analysis of Some Randomized Algorithms. 30-53
BibTeX
Jia-Huai You
: Unification Modulo an Equality Theory for Equational Logic Programming. 54-75
BibTeX
Richard Beigel
: Relativized Counting Classes: Relations among Thresholds, Parity, and Mods. 76-96
BibTeX
Hans L. Bodlaender
: Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors. 97-118
BibTeX
Ming Li
,
Yaacov Yesha
: Resource Bounds for Parallel Computation of Threshold and Symmetric Functions. 119-137
BibTeX
Volume 42, Number 2, April 1991
Elio Giovannetti
,
Giorgio Levi
,
Corrado Moiso
,
Catuscia Palamidessi
: Kernel-LEAF: A Logic plus Functional Language. 139-185
BibTeX
Friedrich Otto
,
Celia Wrathall
: Overlaps in Free Partially Commutative Monoids. 186-198
BibTeX
Jeffrey F. Naughton
: One-Sided Recursions. 199-236
BibTeX
Max H. Garzon
,
Yechezkel Zalcstein
: On Isomorphism Testing of a Class of 2-Nilpotent Groups. 237-248
BibTeX
Herbert Edelsbrunner
,
Leonidas J. Guibas
: Corrigendum: Topologically Sweeping an Arrangement. 249-251
BibTeX
, ->
JCSS 38
(1): 165-194 (1989)
Volume 42, Number 3, June 1991
Selected Papers from
FOCS 1987
Pavol Duris
,
Zvi Galil
: Two Lower Bounds in Asynchronous Distributed Computation. 254-266
BibTeX
Andrew Chi-Chih Yao
: Lower Bounds to Randomized Algorithms for Graph Properties. 267-287
BibTeX
Arkady Kanevsky
,
Vijaya Ramachandran
: Improved Algorithms for Graph Four-Connectivity. 288-306
BibTeX
Abhiram G. Ranade
: How to Emulate Shared Memory. 307-326
BibTeX
William Aiello
,
Johan Håstad
: Statistical Zero-Knowledge Languages can be Recognized in Two Rounds. 327-345
BibTeX
Yuri Gurevich
: Average Case Completeness. 346-398
BibTeX
Copyright ©
Sun May 17 00:08:11 2009 by
Michael Ley
(
ley@uni-trier.de
)