On quasilinear-time complexity theory

Nonerasing, counting, and majority over the linear time hierarchy

Information and Computation

A survey of lower bounds for satisfiability and related problems

Foundations and Trends® in Theoretical Computer Science

Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

Computational Complexity

Observations on complete sets between linear time and polynomial time

Information and Computation

Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

Proceedings of the 4th conference on Innovations in Theoretical Computer Science