My recommendations for everyone

- Algorithms - Design and Analysis
- Introduction to Algorithms -
*by Cormen, Leiserson, Rivest and Stein.* - Algorithms -
*by Dasgupta, Papadimitriou, Vazirani.*

- Introduction to Algorithms -
- Computational Complexity
- Computational Complexity: A Modern Approach -
*by Arora and Barak.*

- Computational Complexity: A Modern Approach -
- Algebraic Complexity Theory
- A selection of lower bounds in arithmetic circuit complexity -
*by Ramprasad Saptharishi.*

- A selection of lower bounds in arithmetic circuit complexity -

- Introduction to Theoretical Computer Science
- Harvard, Fall 2019 -
*by Boaz Barak.* - CMU, Spring 2020 -
*by Ryan O’Donnell.*

- Harvard, Fall 2019 -
- Arithmetic Circuit Complexity/Algebraic Complexity Theory
- IITK, Spring 2019 -
*by Nitin Saxena.* - TIFR, Fall 2017 -
*by Ramprasad Saptharishi.*

- IITK, Spring 2019 -
- Computational Number Theory & Algebra
- IITK, Spring 2020 -
*by Nitin Saxena.* - TIFR, Spring 2019 -
*by Ramprasad Saptharishi.* - MIT, Spring 2012 -
*by Madhu Sudan.*

- IITK, Spring 2020 -

- How I Learned to Stop Worrying -
*Radhika Nagpal* - Who Can Name the Bigger Number? -
*Scott Aaronson*

- Gödel’s Lost Letter and P=NP -
*by Dick Lipton and Ken Regan.* - Shtetl-Optimized -
*by Scott Aaronson.* - Computational Complexity -
*by Lance Fortnow and William Gasarch.* - Theory Matters -
*currently maintained by Shuchi Chawla.* - Windows on Theory -
*mostly by Boaz Barak.* - Theory Annoucements.
- Quanta Magazine.
- Study Hacks Blog -
*by Cal Newport.*