Front cover (PDF)

The effect of the field of constants on the number of multiplications (Abstract)

The exact time required to perform generalized addition (Abstract)

Polynomials with 0-1 coefficients that are hard to evaluate (Abstract)

Fast parallel matrix inversion algorithms (Abstract)

Parallel computations in graph theory (Abstract)

Synchronization and computing capabilities of linear asynchronous structures (Abstract)

Flow of control in the proof theory of structured programming (Abstract)

Bases for chain-complete posets (Abstract)

Correct computation rules for recursive languages (Abstract)

On time versus space and related problems (Abstract)

A note on tape bounds for sla language processing (Abstract)

Minimean optimality in sorting algorithms (Abstract)

Preserving order in a forest in less than logarithmic time (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)

The effect of basis on size of Boolean expressions (Abstract)

Economy of description by parsers, DPDA's, and PDA's (Abstract)

An improvement on valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata (Abstract)

A grammatical characterization of exponential-time languages (Abstract)

Decidability of equivalence, containment, intersection, and separability of context-free languages (Abstract)

Closest-point problems (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)