Front cover (PDF)
On time versus space and related problems (Abstract)
On the complexity of comparison problems using linear functions (Abstract)
Evaluating relational expressions with dense and sparse arguments (Abstract)
On the decision tree complexity of the shortest path problems (Abstract)
An O (N2.5) algorithm for maximum matching in general graphs (Abstract)
Information theory and the complexity of switching networks (Abstract)
A grammatical characterization of exponential-time languages (Abstract)
An optimal bound for two dimensional bin packing (Abstract)
Computational complexity of decision procedures for polynomials (Abstract)
An application of graph coloring to printed circuit testing (Abstract)
On the complexity of time table and multi-commodity flow problems (Abstract)