Editor's foreword
An efficient algorithm for hidden surface removal, II
Efficient NC algorithms for set cover with applications to learning and geometry
The probabilistic method yields deterministic parallel algorithms
Planarity testing in parallel
Datalog vs first-order logic
Open problems in “systems that learn”
On hausdorff and topological dimensions of the kolmogorov complexity of the real line
Another look at parameterization for order-sorted algebraic specifications
Efficient rebalancing of chromatic search trees
The nested universal relation data model
The surjectivity problem for 2D cellular automata
Implication problems for functional constraints on databases supporting complex objects
On search, decision, and the efficiency of polynomial-time algorithms
Author index for volume 49