Volume 15, Number 1, February 1986
Guy W. Cherry:
Integration in Finite Terms with Special Functions: The Logarithmic Integral.
1-21
Joost Engelfriet:
The complexity of Languages Generated by Attribute Grammars.
70-86
Mike Shub,
Steve Smale:
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II.
145-161
Brenda S. Baker:
A Provably Good Algorithm for the Two Module Routing Problem.
162-188
Tuvi Etzion,
Abraham Lempel:
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network.
216-221
John H. Reif:
Logarithmic Depth Circuits for Algebraic Functions.
231-242
Volume 15, Number 2, May 1986
Lenore Blum,
Mike Shub:
Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average.
384-398
Dan E. Willard:
Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel.
468-477
Alan M. Frieze:
On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem.
536-539
Jonathan S. Turner:
On the Probable Performance of Heuristics for Bandwidth Minimization.
561-580
Dung T. Huynh:
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals.
581-594
Volume 15, Number 3, August 1986
Joel Friedman:
Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function of n Boolean Variables.
641-654
J. Scott Provan:
The Complexity of Reliability Computations in Planar and Acyclic Graphs.
694-702
Martin E. Dyer:
On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem.
725-738
Friedrich Otto:
Church-Rosser Thue Systems that Present Free Monoids.
786-792
Justin R. Smith:
Parallel Algorithms for Depth-First Searches I. Planar Graphs.
814-830
Benjamin Arazi:
A Binary Search with a Parallel Recovery of the Bits.
851-855
Richard Hull:
Relative Information Capacity of Simple Relational Database Schemata.
856-886
Volume 15, Number 4, November 1986
David Prill:
On Approximations and Incidence in Cylindrical Algebraic Decompositions.
972-993
Norbert Blum:
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem.
1021-1024
Liwu Li:
Ranking and Unranking of AVL-Trees.
1025-1035
Michael Luby:
A Simple Parallel Algorithm for the Maximal Independent Set Problem.
1036-1053
Dung T. Huynh:
Some Observations about the Randomness of Hard Problems.
1101-1105
Udi Manber:
On Maintaining Dynamic Information in a Concurrent Environment.
1130-1142
data released under the ODC-BY 1.0 license
