- Expanders and Fast Graph Algorithms by Thatchaphol Saranurak
- Lecture Notes for Advanced Graph Algorithms and Optimization by Rasmus Kyng
- Lecture Notes on the Sum Of Squares Algorithm, Boaz Barak and David Steurer
- Virginia Vassilevska Williams' class "Matrix Multiplication and Graph Algorithms"
- Parameterized Algorithms, Marek Cygan et al
- Algorithms for Convex Optimization, Nisheeth K. Vishnoi
- Bandit Algorithms, Tor Lattimore and Csaba Szepesari
- Michael Sipser's Introduction to the Theory of Computation
- Computational Complexity: A Modern Approach
- Luca Trevison's Graduate Complexity Notes
- Virginia Vassilevska Williams' class "Fine-Grained Algorithms and Complexity"
- Ryan Williams' class "Lower Bounds: Beyond the Bootcamp"
- Communication Complexity and Applications, Anup Rao and Amir Yehudayoff
- Communication Complexity (for Algorithm Designers), Tim Roughgarden
- Amir Chakrabarti's Lecture Notes on Streaming Algorithms
- Jelani Nelson's Lecture Notes on Sketching Algorithms
- Ronitt Rubenfield's Class
- Mohsen Ghaffari's Lecture Notes on Distributed Graph Algorithms
- Sepehr Assadi's class on Graph Streaming Algorithms
- Introduction to Property Testing, Goldreich
- Clément Canonne's survey on Distribution Testing
- Boaz Barak's Lecture Notes
- The Foundations of Cryptography, Goldreich
- Scribe notes from Dakshita Khurana's Quantum Cryptography class
- Proofs, Arguments, and Zero-Knowledge by Justin Thaler