Volume 35, Number 1, January 1988
Volume 35, Number 2, April 1988
Ravi S. Sandhu
: The schematic protection model: its definition and analysis for acyclic attenuating schemes.
: Comparing the combinational complexities of arithmetic functions.
: On the complexity of branching programs and decision trees for clique functions.
Volume 35, Number 3, July 1988
: The coloring and maximum independent set problems on planar perfect graphs.
: Busy periods for subnetworks in stochastic networks: mean value analysis.
: A nonlinear lower bound for random-access machines under logarithmic cost.
Volume 35, Number 4, October 1988
: Eliminating go to's while preserving program structure.