Volume 29, Number 1, January 1982
: An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database.
: On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types.
Harry B. Hunt III
: On the Complexity of Flowchart and Loop Program Schemes and Programming Languages.
Michael L. Fredman
: The Complexity of Maintaining an Array and Computing Its Partial Sums.
: Relativized Questions Involving Probabilistic Algorithms.
Volume 29, Number 2, April 1982
: Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions.
: A Complete Axiomatization of Full Join Dependencies.
: Useless Actions Make a Difference: Strict Serializability of Database Updates.
: Determination of the conditional response for quantum allocation algorithms.
R. M. Bryant
: Maximum Processing Rates of Memory Bound Systems.
: A Finite-Source Queue with Different Customers.
Simon S. Lam
: Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants.
: The Performance of Job Classes with Distinct Policy Functions.
Volume 29, Number 3, July 1982
: Testing satisfaction of functional dependencies.
Anthony C. Klug
: Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions.
Harold N. Gabow
: An Almost-Linear Algorithm for Two-Processor Scheduling.
Errol L. Lloyd
: Critical Path Scheduling with Resource and Processor Constraints.
Charles U. Martel
: Preemptive Scheduling with Release Times, Deadlines, and Due Times.
, Marc Snir
: Some Exact Complexity Results for Straight-Line Computations over Semirings.
Volume 29, Number 4, October 1982
Fouad A. Tobagi
: Distributions of packet delay and interdeparture time in slotted ALOHA and carrier sense multiple access.
: Horn clauses and database dependencies.
John C. Beatty
: On the relationship between LL(1) and LR(1) grammars.
Eugene W. Stark
: Semaphore primitives and starvation-free mutual exclusion.
Carl H. Smith
: The Power of Pluralism for Automatic Program Synthesis.
: The equivalence problem for some non-real-time deterministic pushdown automata.