Volume 51, Number 1, 12 July 1994
: New Algorithms for the LCA Problem and the Binary Tree Reconstruction Problem.
, Akira Maruoka
: On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables.
: Logics and Decidability for Labelled Pre- and Partially Ordered Kripke Structures.
Volume 51, Number 2, 26 July 1994
, Henning Rochow
: A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals.
David A. Basin
: A Term Equality Problem Equivalent to Graph Isomorphism.
: An Optimal Bound for Path Weights in Huffman Trees.
Volume 51, Number 3, 10 August 1994
: Counting Trees in a Graph is #P-Complete.
Volume 51, Number 4, 24 August 1994
, Shigeru Masuyama
: On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph.
: A Simplified Account of Polymorphic References.
: Arboricity and Bipartite Subgraph Listing Algorithms.
Volume 51, Number 5, 12 September 1994
Philip M. Long
: Halfspace Learning, Linear Programming, and Nonmalicious Distributions.
: Using Hirschberg's Algorithm to Generate Random Alignments of Strings.
: Serializability by Commitment Ordering.
: Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines.
: Faster Implementation of a Shortest Superstring Approximation.
Volume 51, Number 6, 26 September 1994
: Constructing Sparse Spanners for Most Graphs in Higher Dimensions.
: On Timeout for Global Deadlock Detection in Decentralized Database Systems.
: Extending Bachmair's Method for Proof by Consistency to the Final Algebra.
: On the Complexity of Computing Gröbner Bases in Characteristic 2.