Volume 9, Number 1, 20 July 1979
Paulo A. S. Veloso
: Characterizing the Regular Prefix Codes and Right Power-Bounded Languages.
Marek J. Lao
: A New Data Structure for the UNION-FIND Problem.
Andrew Chi-Chih Yao
: A Note on a Conjecture of Kam and Ullman Concerning Statistical Databases.
: From Left-Regular to Greibach Normal Form Grammars.
Volume 9, Number 2, 17 August 1979
: The Unsolvability of Some Petri Net Language Problems.
F. N. Teskey
: Document Retrieval Using Associative Processors.
: A Note on the Complexity of Approximative Evaluation of Polynomials.
W. S. Luk
: `Possible' Membership of a Multivalued Dependency in a Relational Database.
: Partial Values in a Tabular Database Model.
Volume 9, Number 3, 5 October 1979
: A Note on the Proof of a Concurrent Program.
: A Randomized Algorithm for Checking Equivalence of Circular Lists.
: A Note on the Pumping Lemma for Regular Languages.
: Reduction of Page Swaps on the Two Dimensional Transforms in a Paging Environment.
: Stack Implementation of Shallow Binding in Languages with Mixed Scoping.
Volume 9, Number 4, 20 November 1979
Joseph Y.-T. Leung
: Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints.
J. Strother Moore
: A Mechanical Proof of the Termination of Takeuchi's Function.
Volume 9, Number 5, 16 December 1979
: Cyclomatic Numbers Do Not Measure Complexity of Unstructured Programs.
A. M. Andrew
: Another Efficient Algorithm for Convex Hulls in Two Dimensions.
J. M. Robson
: The Emptiness of Complement Problem for Semi Extended Regular Expressions Requires cn Space.
Sandra L. Mitchell
: Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs.
: Cost-Minimal Preemptive Scheduling of Independent Jobs With Release and Due Dates on Open Shop Under Resource Constraints.