Volume 34, Number 1, January 1987
Victor Vianu:
Dynamic functional dependencies and database aging.
28-59
Yoshihito Toyama:
On the Church-Rosser property for the direct sum of term rewriting systems.
128-143
Rüdiger Reischuk:
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions.
163-178
Richard Cole:
Slowing down sorting networks to obtain faster sorting algorithms.
200-208
Volume 34, Number 2, April 1987
Steven Homer:
Minimal degrees for polynomial reducibilities.
480-491
K. N. Venkataraman:
Decidability of the purely existential fragment of the theory of term algebras.
492-510
Volume 34, Number 3, July 1987
Randolph D. Nelson:
Stochastic catastrophe theory in computer performance modeling.
661-685
Rajan Suri:
Infinitesimal perturbation analysis for general discrete event systems.
686-717
Volume 34, Number 4, October 1987
Dan E. Willard:
Multidimensional search trees that provide new types of memory reductions.
846-858
Gabriel Bracha:
An O(log n) expected rounds randomized byzantine generals protocol.
910-920
Prasoon Tiwari:
Lower bounds on communication complexity in distributed computer networks.
921-938
Shu Tezuka:
On the discrepancy of GFSR pseudorandom numbers.
939-949
Donald B. Johnson:
Parallel algorithms for minimum cuts and maximum flows in planar networks.
950-967
Michael Kaminski:
A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor.
968-984
James McKenna:
Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks.
985-1003
data released under the ODC-BY 1.0 license
