Volume 41, Number 1, 21 January 1992
Volume 41, Number 2, 14 February 1992
: On Efficient Implementation of LR-Attributed Grammars.
Carlisle M. Adams
: On Immunity Against Biham and Shamir's ``Differential Cryptanalysis''.
: Finding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard.
Volume 41, Number 3, March 1992
: Fast Inversion of Hankel and Toeplitz Matrices.
: Parallel Complexity of Computing a Maximal Set of Disjoint Paths.
: Optimal Parallel 3-Coloring Algorithm for Rooted Trees and its Applications.
Volume 41, Number 4, 18 March 1992
L. C. Wu
, C. Y. Tang
: Solving the Satisfiability Problem by Using Randomized Approach.
Samuel N. Kamin
: Head-Strictness is Not a Monotonic Abstract Property.
Samuel R. Buss
: The Graph of Multiplication is Equivalent to Counting.
Volume 41, Number 5, 3 April 1992
: Alternative Developments of Cyclic-Permutation Algorithms.
: An Improved Parallel Algorithm for Computing the Generalized Inverse A+.
: R-Generability, and Definability in Branching Time Logics.
Volume 41, Number 6, 17 April 1992
: Almost all Boolean Functions Have no Linear Symmetries.
: Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting.
L. L. Miller
: Generating Hinges from Arbitrary Subhypergraphs.
: A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming.
Nader H. Bshouty
: A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial.
: An Approximation Algorithm for the General Routing Problem.