Volume 17, Number 1, February 1988
: On Bounded Database Schemes and Bounded Horn-Clause Programs.
: Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed.
David M. Nicol
: Expected Performance of m-Solution Backtracking.
, Uzi Vishkin
: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time.
Volume 17, Number 2, April 1988
: How to Generate Factored Random Numbers.
, Oded Goldreich
: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity.
: Solving Simultaneous Modular Equations of Low Degree.
Volume 17, Number 3, June 1988
: A Functional Approach to Data Structures and Its Use in Multidimensional Searching.
, Yaacov Yesha
: A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs.
: A Graph Theoretic Approach to Statistical Data Security.
Timothy J. Long
: Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles.
Volume 17, Number 4, August 1988
John W. John
: A New Lower Bound for the Set-Partitioning Problem.
: On the Expected Sublinearity of the Boyer-Moore Algorithm.
Paul M. B. Vitányi
: Locality, Communication, and Interconnect Length in Multicomputers.
, C. W. Lai
: The Probabilistic Analysis of a Heuristic for the Assignment Problem.
: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments.
: A Natural NP-Complete Problem with a Nontrivial Lower Nound.
Harold N. Gabow
: Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines.
Volume 17, Number 5, October 1988
J. Scott Provan
: An Approximation Scheme for Finding Steiner Trees with Obstacles.
: Nondeterministic Space is Closed Under Complementation.
: A Linear Algorithm for Topological Bandwidth in Degree-Three Trees.
: Optimal Bounds for Solving Tridiagonal Systems with Preconditioning.
Volume 17, Number 6, December 1988
, Yossi Azar
: The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms.
: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses.