WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE

On Almost Everywhere Complex Recursive Functions

Journal of the ACM (JACM)

On Reducibility to Complex or Sparse Sets

Journal of the ACM (JACM)

The intrinsically exponential complexity of the circularity problem for attribute grammars

Communications of the ACM

Structure of complexity in the weak monadic second-order theories of the natural numbers

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Sets that don't help

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing

Complexity of Aperiodicity for Topological Properties of Regular ω-Languages

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms