| A Relation Between Sparse and Printable Sets in NSPACE(log n) | 0 | 0.34 | 1997 |
| Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata | 9 | 0.59 | 1989 |
| The Logarithmic Alternation Hierarchy Collapses: A \sum^\calL_2=APi^\calL_2 | 3 | 0.55 | 1989 |
| The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2 | 0 | 0.34 | 1987 |
| Separation with the Ruzzo, Simon, and Tompa relativization implies Dspace(log n) ≠ Nspace(log n) | 6 | 0.59 | 1987 |
