Volume 27, Number 1, February 1988
Volume 27, Number 2, February 1988
: A Practical Method for Finding the Optimum Postponement Transformation for LR(k) Parsers.
, Yelena Yesha
: A Polynomial Algorithm for Computation of the Probability of Conflicts in a Database Under Arbitrary Data Access Distribution.
: A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem.
Ravi S. Sandhu
: Cryptographic Implementation of a Tree Hierarchy for Access Control.
Volume 27, Number 3, March 1988
Volume 27, Number 4, April 1988
Yung H. Tsin
: On Handling Vertex Deletion in Updating Spanning Trees.
: Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons.
, Sam Toueg
: Effects of Message Loss on the Termination of Distributed Protocols.
Volume 27, Number 5, April 1988
, Kurt Mehlhorn
: Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees.
Bob P. Weems
: A Study of Page Arrangements for Extendible Hashing.
: The Complexity of Ultrametric Partitions on Graphs.
Volume 27, Number 6, May 1988
Hans L. Bodlaender
: A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors.
: Optimal Fault-Tolerant Distributed Construction of a Spanning Forest.
: Proof System for Weakest Prespecification.
M. A. Sridhar
: On the Connectivity of the De Bruijn Graph.
: A Lower Bound for the Edit-Distance Problem Under an Arbitrary Cost Function.