Volume 34, Number 1, January 1987
: Dynamic functional dependencies and database aging.
: On the Church-Rosser property for the direct sum of term rewriting systems.
: Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions.
: Slowing down sorting networks to obtain faster sorting algorithms.
Volume 34, Number 2, April 1987
: Minimal degrees for polynomial reducibilities.
K. N. Venkataraman
: Decidability of the purely existential fragment of the theory of term algebras.
Volume 34, Number 3, July 1987
Randolph D. Nelson
: Stochastic catastrophe theory in computer performance modeling.
: Infinitesimal perturbation analysis for general discrete event systems.
Volume 34, Number 4, October 1987
Dan E. Willard
: Multidimensional search trees that provide new types of memory reductions.
: An O(log n) expected rounds randomized byzantine generals protocol.
: Lower bounds on communication complexity in distributed computer networks.
: On the discrepancy of GFSR pseudorandom numbers.
Donald B. Johnson
: Parallel algorithms for minimum cuts and maximum flows in planar networks.
: A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor.
: Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks.