In Alan L. Selman, editor, Structure in Complexity Theory , volume 223 of Lecture Notes in Computer Science , page 196, Berkeley, California, 2-5 June 1986. The complexity of optimization problems. In Alan L. Selman, editor, Structure in Complexity Theory , volume 223 of Lecture Notes in Computer Science , page 218, Berkeley, California, 2-5 June 1986. The power of the queue. An optimal lower bound for Turing machines with one work tape and a two way input tape.
Separation results for bounded alternation.
The topology of provability in complexity theory. David A. Russo . Optimal approximations of complete sets. Diagonalisation methods in a polynomial setting. Bounded oracles and complexity classes inside linear space.