Separating NP-Completeness Notions under Strong Hypotheses. - Klaus Ambos-Spies; Levke Bentzien (CCC, 1997)

Positive Turing and Truth-Table Completeness for NEXP Are Incomparable. - Levke Bentzien (MFCS, 1998)

NP-completeness notions under strong hypotheses. - Levke Bentzien (2000)