Structural properties of complete problems for exponential time

Measure Theoretic Completeness Notions for the Exponential Time Classes

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science

On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science

SIGACT news complexity theory column 40

ACM SIGACT News

Comparing reductions to NP-complete sets

Information and Computation

Query-monotonic Turing reductions

Theoretical Computer Science

Non-mitotic sets

Theoretical Computer Science

Non-mitotic sets

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science

Query-monotonic turing reductions

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Comparing reductions to NP-complete sets

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I