Volume 40, Number 1, 11 October 1991
: Lower and Upper Power Domain Constructions Commute on all Cpos.
Thomas C. Shermer
: A Counterexample to the Algorithms for Determining Opaque Minimal Forests.
Volume 40, Number 2, 25 October 1991
: On the Dynamic Maintenance of Maximal Points in the Plane.
: Modal Functions for Concise Definition of State Machines and Products.
: New Enumeration Results About the Optical Orthogonal Codes.
: On the Complexity of the Extreme Points Decision Problem.
Volume 40, Number 3, 8 November 1991
: Binary Self-Stabilization in Distributed Systems.
: Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems.
: Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls.
Volume 40, Number 4, 25 November 1991
Jeffrey K. Uhlmann
: Satisfying General Proximity/Similarity Queries with Metric Trees.
: DFS-Traversing Graphs in a Paging Environment, LRU or MRU?
: On the Logarithmic Evaluation of Recurrence Relations.
: An Agent Calculus with Simple Actions Where the Enabling and Disabling are Derived Operators.
: Fast Algorithms for Lowest Common Ancestors on a Processor Array with Reconfigurable Buses.
Volume 40, Number 5, 13 December 1991
Jimmi S. Pettersson
: Comments on ``Always-True is not Invariant'': Assertional Reasoning About Invariance.
: Distributed User Identification by Zero-Knowledge Access Rights Proving.
: A Randomized NC Algorithm for the Maximal Tree Cover Problem.
James K. Park
: A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time.
: Further Comments on the Subtree Isomorphism for Ordered Trees.
Iain A. Stewart
: Complete Problems for Symmetric Logspace Involving Free Groups.
Volume 40, Number 6, 30 December 1991
: Reducing Conflict Resolution Time for Solving Graph Problems in Broadcast Communications.
: Evaluating Clustering Factor Approach to Estimating Block Selectivities.
: Distributed Evaluation of an Iterative Function for all Object Pairs on an SIMD Hybercube.