- Amir Shpilka, Amir Yehudayoff. Arithmetic Circuits: A survey of recent results and open questions. Foundations and Trends in Theoretical Computer Science, 5(3-4):207-388, 2010.
- Troy Lee, Adi Shraibman. Lower Bounds in Communication Complexity. Foundations and Trends in Theoretical Computer Science, 3(4):263-398, 2009.
- Emanuele Viola. On the Power of Small-Depth Computation. Foundations and Trends in Theoretical Computer Science, 5(1):1-72, 2009.
- Satyanarayana V. Lokam. Complexity Lower Bounds using Linear Algebra. Foundations and Trends in Theoretical Computer Science, 4(1-2):1-155, 2009.
- Ravi Kannan, Santosh Vempala. Spectral Algorithms. Foundations and Trends in Theoretical Computer Science, 4(3-4):157-288, 2009.
- Niv Buchbinder, Joseph Naor. The Design of Competitive Online Algorithms via a Primal-Dual Approach. Foundations and Trends in Theoretical Computer Science, 3(2-3):93-263, 2009.
- Dana Ron. Algorithmic and Analysis Techniques in Property Testing. Foundations and Trends in Theoretical Computer Science, 5(2):73-205, 2009.
- Oded Goldreich. Probabilistic Proof Systems: A Primer. Foundations and Trends in Theoretical Computer Science, 3(1):1-91, 2008.
- Andrej Bogdanov, Luca Trevisan. Average-Case Complexity. Foundations and Trends in Theoretical Computer Science, 2(1), 2006.
- Venkatesan Guruswami. Algorithmic Results in List Decoding. Foundations and Trends in Theoretical Computer Science, 2(2), 2006.