Recursively Enumerable Sets Which are Uniform for Finite Extensions. - Donald A. Alton (J. Symb. Log., 1971)

Non-existence of program optimizers in an abstract setting. - Donald A. Alton; John L. Lowther (Symposium on Programming, 1974)

A characterization ofR-maximal sets. - Donald A. Alton (Arch. Math. Log., 1975)

Embedding relations in the lattice of recursively enumerable sets. - Donald A. Alton (Arch. Math. Log., 1975)

Nonexistence of Program Optimizers in Several Abstract Settings. - Donald A. Alton (J. Comput. Syst. Sci., 1976)

Diversity of Speed-Ups and Embeddability in Computational Complexity. - Donald A. Alton (J. Symb. Log., 1976)

"Natural" Complexity Measures and Time versus Memory: Some Definitional Proposals. - Donald A. Alton (ICALP, 1977)

"Natural" Complexity Measures and a Subrecursive Speed-up Theorem. - Donald A. Alton (IFIP Congress, 1977)