Volume 15, Number 1, February 1986
Guy W. Cherry
: Integration in Finite Terms with Special Functions: The Logarithmic Integral.
: The complexity of Languages Generated by Attribute Grammars.
, Steve Smale
: Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II.
Brenda S. Baker
: A Provably Good Algorithm for the Two Module Routing Problem.
, Abraham Lempel
: An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network.
John H. Reif
: Logarithmic Depth Circuits for Algebraic Functions.
Volume 15, Number 2, May 1986
, Mike Shub
: Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average.
Dan E. Willard
: Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel.
Alan M. Frieze
: On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem.
Jonathan S. Turner
: On the Probable Performance of Heuristics for Bandwidth Minimization.
Dung T. Huynh
: The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals.
Volume 15, Number 3, August 1986
: Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function of n Boolean Variables.
J. Scott Provan
: The Complexity of Reliability Computations in Planar and Acyclic Graphs.
Martin E. Dyer
: On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem.
: Church-Rosser Thue Systems that Present Free Monoids.
Justin R. Smith
: Parallel Algorithms for Depth-First Searches I. Planar Graphs.
: A Binary Search with a Parallel Recovery of the Bits.
: Relative Information Capacity of Simple Relational Database Schemata.
Volume 15, Number 4, November 1986
: On Approximations and Incidence in Cylindrical Algebraic Decompositions.
: On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem.
: Ranking and Unranking of AVL-Trees.
: A Simple Parallel Algorithm for the Maximal Independent Set Problem.
Dung T. Huynh
: Some Observations about the Randomness of Hard Problems.
: On Maintaining Dynamic Information in a Concurrent Environment.