Volume 24, Number 1, January 1987
, Somenath Biswas
: An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences.
Volume 24, Number 2, January 1987
: An Infinite Word Language Which is Not co-CFL.
: Concurrent Execution of Transaction Copies.
: A Note on a New Data Structure for in-the-Past Queries.
: The Program Dependence Graph in Static Program Testing.
Volume 24, Number 3, February 1987
: The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors.
Richard P. Anstee
: A Polynomial Algorithm for b-Matchings: An Alternative Approach.
Dung T. Huynh
: On Solving Hard Problems by Polynomial-Size Circuits.
: How to Compare the Incomparable.
: An Algorithm for Determining an Opaque Minimal Forest of a Convex Polygon.
: A Distributed Algorithm to Prevent Mutual Drift Between n Logical Clocks.
: A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs.
Volume 24, Number 4, March 1987
, B. B. Madan
: Time Efficient Systolic Architecture for Matrix * Vector Multiplication.
: A Variant of Heapsort with Almost Optimal Number of Comparisons.
: A Liveness Property of a Parallel Algorithm.
Volume 24, Number 5, March 1987
Robert D. Tennent
: A Note on Undefined Expression Values in Programming Logics.
Michael B. Dillencourt
: Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations.
Volume 24, Number 6, April 1987
: Sorting Numbers Using Limited Systolic Coprocessors.
: There are no Fully Space Constructible Functions Between log log n and log n.
: An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits.
William E. Wright
: A Note on External Sorting Using Almost Single Input Buffering.
M. K. Sridhar
: A New Algorithm for Parallel Solution of Linear Equations.