Volume 6, Number 1, January 1995
: A Tight Upper Bound on the Cover Time for Random Walks on Graphs.
: On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae.
: A Passage Time for Greedy-Coloring Cycles.
Volume 6, Number 2/3, March-May 1995
: On the Inner Structure of Multidimensional Simply Generated Trees.
V. F. Kolchin
: On Classification in Presence of Measurement Errors.
: Probabilities in First-Order Logic of a Unary Function and a Binary Relation.
David A. Grable
: The Diameter of a Random Graph with Bounded Diameter.
James F. Lynch
: On the Threshold of Chaos in Random Boolean Cellular Automata.
: Maximal Full Subspaces in Random Projective Spaces- Thresholds and Poisson Approximation.
: How to Make A Random Graph Irregular.
: A Graph Fourier Transform and Proportional Graphs.
: Correlations on the Strata of a Random Mapping.
Volume 6, Number 4, July 1995
: Improved Boolean Formulas for the Ramsey Graphs.
: A Tight Lower Bound on the Cover Time for Random Walks on Graphs.
: On the 2-Cyclic Property in 2-Regular Digraphs.
, Mike Paterson
: Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.