Bounds on the evaluation time for rational polynomials. Alvy Ray Smith III . Two-dimensional formal languages and pattern recognition by cellular automata. Characterizations of locally testable events. Priority paging algorithms and the extension problem.
Time bounds on space computations.
Economy of description by automata, grammars, and formal systems. Languages for defining sets in arbitrary algebras. Complete linear proofs of systems of linear inequalities. Analysis of sorting algorithms. Edward M. Reingold .