Volume 68, Number 1, 15 October 1998
, Alistair Moffat
: Comment on ``Efficient Huffman Decoding'' and ``An Efficient Finite-State Machine Implementation of Huffman Decoders''.
Volume 68, Number 2, 30 October 1998
Joost P. Warners
: A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form.
Colin J. Fidge
: A Limitation of Vector Timestamps for Reconstructing Distributed Computations.
Volume 68, Number 3, 15 November 1998
: Robust Vector Space Secret Sharing Schemes.
Chor Ping Low
: A Polynomial Time Solvable Instance of the Feasible Minimum Cover Problem.
Valery S. Gordon
, Wieslaw Kubiak
: Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs.
Volume 68, Number 4, 30 November 1998
: Complexity Versus Stability for Classes of Propositional Formulas.
Wim H. Hesselink
: Invariants for the Construction of a Handshake Register.
: On Ring Embedding in Hypercubes with Faulty Nodes and Links.
Volume 68, Number 5, 15 December 1998
: Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems.
: Binary Search with Errors and Variable Cost Queries.
Volume 68, Number 6, 30 December 1998
: A New Algebraic Algorithm to Decode the Ternary Golay Code.
Rakesh K. Sinha
: Simulation of PRAMs with Scan Primitives by Unbounded Fan-In Circuits.
Janelle J. Harms
: A Simple Optimal Algorithm for Scheduling Variable-Sized Requests.
: Local Calculation of Voronoi Diagrams.