Volume 63, Number 1, 14 July 1997
Marten van Dijk
: More Information Theoretical Inequalities to be Used in Secret Sharing?
, Errol L. Lloyd
: Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time.
: A Lower Bound for Randomized On-Line Multiprocessor Scheduling.
Volume 63, Number 2, 28 July 1997
J. G. Gaines
: Partitions with Minimum Entropy of Regions in R².
: Performance Bounds for Modeling NUMA Architectures.
Volume 63, Number 3, 14 August 1997
Abdel Krim Amoura
: A Note on Scheduling Multiprocessor Tasks with Precedence Constraints on Parallel Processors.
: A Nonapproximability Result for Finite Function Generation.
: Computing OR on a Randomized Fixed Adversary CRCW PRAM.
Volume 63, Number 4, 28 August 1997
, Juhnyoung Lee
, Sudha Ram
: Updating Timestamp Interval for Dynamic Adjustment of Serialization Order in Optimistic Concurrency Control-Time Interval (OCCTI) Protocol.
: Distributed Routing in a Fault-Tolerant Multistage Interconnection Network.
Volume 63, Number 5, 15 September 1997
Clark F. Olson
: An Approximation Algorithm for Least Median of Squares Regression.
, Thomas Wilke
: Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator.
: Languages Represented by Boolean Formulas.
Ravi B. Boppana
: The Average Sensitivity of Bounded-Depth Circuits.
Bang Ye Wu
, Chuan Yi Tang
: An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree.
Volume 63, Number 6, 29 September 1997
Sung Kwon Kim
: Logarithmic Width, Linear Area Upward Drawing of AVL Trees.
: On Non-Smooth Convex Distance Functions.