Volume 22, Number 1, January 1986
: On Transformations of Algorithms to Multiply 2*2 Matrices.
Victor Y. Pan
: The Trade-Off Between the Additive Complexity and the Asynchronicity of Linear and Bilinear Algorithms.
: The Greedy and Delaunay Triangulations are Not Bad in the Average Case.
Louis E. Rosier
: A Note on Presburger Arithmetic with Array Segments, Permutation and Equality.
: Hexagonal Unit Network a Tool for Proving the NP-Completeness Results of Geometric Problems.
Volume 22, Number 2, 1986
: EDISON-80, a Language for Modular Programming of Parallel Processes.
Charles U. Martel
: Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set.
: Some Remarks on the Possibility of Extending Resolution Proof Procedures to Intuitionistic Logic.
: Exact Balancing is Not Always Good.
Volume 22, Number 3, March 1986
: Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets.
: Nonisomorphic Graphs with the Same T-Polynomial.
: A Novel Representation of Lists and its Application to the Function "reverse".
: O(1) Space Complexity Deletion for AVL Trees.
R. C. Shock
: Computing the Minimum Cover of Functional Dependencies.
Volume 22, Number 4, 17 April 1986
, Michel Minoux
: An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs.
: A Note on the Higher Moments of the Expected Behavior of Straight Insertion Sort.
M. C. Hambury
: Two Tagless Variations on the Deutsch-Schorr-Waite Algorithm.
Volume 22, Number 5, April 1986
Peter T. Highnam
: Optimal Algorithms for Finding the Symmetries of a Planar Point Set.
, Yaacov Yesha
: String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation.
John B. Evans
: Experiments with Trees of the Storage and Retrieval of Future Events.
Herbert J. Bernstein
: Determining the Shape of a Convex n-Sided Polygon by Using 2n+k Tactile Probes.
Arthur M. Keller
: Set-Theoretic Problems of Null Completion in Relational Databases.
Volume 22, Number 6, May 1986
: Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two.
: On Recurrent and Recursive Interconnection Patterns.
Frank K. H. A. Dehne
: O(n^(1/2)) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer.
: An Algorithm to Generate a Random Cyclic Permutation.