Volume 1, Number 1, February 1988
: Neural Networks, Acyclic Orientations of the Hypercube, and Sets of Orthogonal Vectors.
David A. Carlson
: Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms.
: Searching for Two Objects by Underweight Feedback.
: Quick Gossiping by Conference Calls.
: Some Applications of Affine Gale Diagrams to Polytopes with few Vertices.
: Questions Related to the Erdös-Turan Conjecture.
Volume 1, Number 2, May 1988
: The Union of Matroids and the Rigidity of Frameworks.
: Almost Every Randomly Near-Traceable Graph Has Diameter at Most Two.
Volume 1, Number 3, August 1988
: Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures.
: Polynomial Bound for a Chip Firing Game on Graphs.
Volume 1, Number 4, November 1988
Hal A. Kierstead
: The Linearity of First-Fit Coloring of Interval Graphs.