Some results on relativized deterministic and nondeterministic time hierarchies
Regularity and firing sequences of computation graphs
Growth patterns of ordered cellular automata
The decidability of the DOL-DTOL equivalence problem
A note on structure and looking back applied to the relative complexity of computable functions
On minimal augmentation of a graph to obtain an interval graph
An improved simulation result for ink-bounded turing machines