Volume 24, Number 1, February 1995
: Planar Strong Connectivity Helps in Parallel Depth-First Search.
, Luca Gemignani
: Fast Parallel Computation of the Polynomial Remainder Sequence Via Bezout and Hankel Matrices.
: On the Optimality of Randomized alpha-beta Search.
Volume 24, Number 2, April 1995
, H. Ramesh
: Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs.
, Dennis Shasha
: D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems.
: Randomized Interpolation and Approximation of Sparse Polynomials.
Volume 24, Number 3, June 1995
: O(M*N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs.
: Evaluation of Polynomials Using the Structure of the Coefficients.
András A. Benczúr
: Counterexamples for Directed and Node Capacitated Cut-Trees.
: A Generalization of the Suffix Tree to Square Matrices, with Applications.
: Approximate Max-Flow on Small Depth Networks.
Volume 24, Number 4, August 1995
: Computing the Degree of Determinants Via Combinatorial Relaxation.
Volume 24, Number 5, October 1995
: Nearly Optimal Algorithms for Canonical Matrix Forms.
: A Subexponential Algorithm for Abstract Optimization Problems.
: With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets.
, Ming Li
: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences.
Volume 24, Number 6, December 1995
: On the Reuse of Additions in Matrix Multiplication.