Time bounded random access machines. Process complexity and effective random tests. Walter J. Savitch . Maze recognizing automata and nondeterministic tape complexity. Characterizations of flowchartable recursions.
Time bounds for selection.
The unsolvability of the equality problem for sentential forms of context-free grammars. The efficient calculation of powers of polynomials. Takeo Yaku . The constructibility of a configuration in a cellular automaton. Distributions of queue lengths and waiting times in a loop with two-way traffic.