Your search for Foundations and Trends (R) in Theoretical Computer Science

Higher-order Fourier Analysis and Applications

Semialgebraic Proofs and Efficient Algorithm Design

Complexity Theory, Game Theory, and Economics

Paradigms for Unconditional Pseudorandom Generators

On Doubly-Efficient Interactive Proof Systems

Quantified Derandomization

Approximate Degree in Classical and Quantum Computing

The Algorithmic Foundations of Differential Privacy

Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities

Sketching as a Tool for Numerical Linear Algebra

Quantum Hamiltonian Complexity

A Decade of Lattice Cryptography

Communication Complexity (for Algorithm Designers)

Quantum Proofs

Scalable Algorithms for Data and Network Analysis

Online Matching and Ad Allocation

Complexity of Linear Boolean Operators

Evasiveness of Graph Properties and Topological Fixed-Point Theorems

Locally Decodable Codes

Pseudorandomness