Volume 26, Number 1, February 1997
: Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables.
Volume 26, Number 2, April 1997
: A Strip-Packing Algorithm with Absolute Performance Bound 2.
Greg N. Frederickson
: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees.
Rakesh M. Verma
: General Techniques for Analyzing Recursive Algorithms with Applications.
: Potentials in Undirected Graphs and Planar Multiflows.
Volume 26, Number 3, June 1997
: On the Complexity of Finding a Minimum Cycle Cover of a Graph.
: Bounds for the Computational Power and Learning Complexity of Analog Neural Nets.
: Bounds on the Number of Examples Needed for Learning Functions.
Volume 26, Number 4, August 1997
, Michael Tarsi
: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture.
Volume 26, Number 5, October 1997
Sam M. Kim
: Computational Modeling for Genetic Splicing Systems.
Brenda S. Baker
: Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance.
Peter W. Shor
: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.
Volume 26, Number 6, December 1997
Philip D. MacKenzie
: The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms.
: Randomized Õ(M(|V|)) Algorithms for Problems in Matching Theory.