Volume 52, Number 1, October 1994
Torben Æ. Mogensen
: WORM-2DPDAs: An Extension to 2DPDAs that can be Simulated in Linear Time.
Volume 52, Number 2, 28 October 1994
: Haskell Overloading is DEXPTIME-Complete.
: Semi-Unification of Two Terms in Abelian Groups.
Volume 52, Number 3, 11 November 1994
Y. Daniel Liang
: On the Feedback Vertex Set Problem in Permutation Graphs.
: Average-Case Scalable On-Line Algorithms for Fault Replacement.
: Approximate Map Labeling is in Omega (n log n).
: On the Learnability of Monotone k \mu-DNF Formulae Under Product Distributions.
Volume 52, Number 4, November 1994
: The Convergence Span of Greedy Load Balancing.
: An Efficient Transitive Closure Algorithm for Cyclic Digraphs.
: An Optimal Parallel Algorithm for Maximal Matching.
Volume 52, Number 5, 9 December 1994
: Refined Simulation of Multihead Automata.
Eric T. Bax
: Algorithms to Count Paths and Cycles.
Mark Allen Weiss
: Linear-Time Construction of Treaps and Cartesian Trees.
: A Parallel Algorithm for Finding a Triconnected Component Separator with an Application.
Volume 52, Number 6, 23 December 1994
: On Repeated Factors in C^\infty-Words.
Philip N. Klein
: A Data Structure for Bicategories, with Application to Speeding up an Approximation Algorithm.
: On the Determinacy Problem for Two-Way Pushdown Automata.
: An Upper Bound on the Number of Functions Satisfying the Strict Avalanche Criterion.
Ravi B. Boppana
: The Decision-Tree Complexity of Element Distinctness.
: A Complete Equational Axiomatization for Prefix Iteration.