Volume 43, Number 1, 10 August 1992
: Does Randomization Help in On-Line Bin Packing?
: Associative-Commutative Reduction Orderings.
: Approximate Decision Algorithms for Approximate Congruence.
: Learning Convex Bodies under Uniform Distribution.
: An Algorithm for Flow Time Minimization and its Asymptotic Makespan Properties.
Volume 43, Number 2, 24 August 1992
Volume 43, Number 3, 14 September 1992
Oege de Moor
: Inductive Data Types for Predicate Transformers.
: On Undecidability of Propositional Temporal Logics on Trace Systems.
Volume 43, Number 4, 28 September 1992
: A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula.
: A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem.
: On Sorting in the Presence of Erroneous Information.
Volume 43, Number 5, 5 October 1992
André van Vliet
: An Improved Lower Bound for On-Line Bin Packing Algorithms.
Volume 43, Number 6, 19 October 1992
, Fu-Hsing Wang
: Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs.
Eliezer A. Albacea
: A Parallel Algorithm for Edge-Coloring of Graphs with Edge-Disjoint Cycles.
: A Note on Two-Way Probabilistic Automata.