Volume 30, Number 1, January 1983
, A. Mahanti
: Search Algorithms Under Different Kinds of Heuristics-A Comparative Study.
Dilip V. Sarwate
: A Note on ``A Note on Multiple Error Detection in ASCII Numeric Data Communication''.
Anthony C. Klug
: Locking Expressions for Increased Database Concurrency.
: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem.
: Polynomial-Time Aggregation of Integer Programming Problems.
Krzysztof R. Apt
: Formal Justification of a Proof System for Communicating Sequential Processes.
Volume 30, Number 2, April 1983
G. W. Stewart
: Computable Error Bounds for Aggregated Markov Chains.
Cyrus F. Nourani
: Abstract Implementations and Their Correctness Proofs.
Volume 30, Number 3, July 1983
Kenneth J. Supowit
: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees.
: Degrees of Acyclicity for Hypergraphs and Relational Database Schemes.
: Parametric Combinatorial Computing and a Problem of Program Module Distribution.
: Robustness of Queuing Network Formulas.
: The Complexity of Solving Polynomial Equations by Quadrature.
: Time-Space Trade-offs for Some Algebraic Problems.
Volume 30, Number 4, October 1983
Dana S. Nau
: Decision Quality As a Function of Search Depth on Game Trees.
: Improving the Performance Guarantee for Approximate Graph Coloring.
: The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks.
: Applying Parallel Computation Algorithms in the Design of Serial Algorithms.