Resources

Here are a few resources for aspiring theoreticians. When I first set out on this journey, I felt so lost; and feel no one else should. None of the material linked on this page belong to me: full credits to the creators and authors. This page is dynamic.

Books and Papers

Computational Complexity Theory

  1. Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak
  2. Theory of Computation: Michael Sipser
  3. The Electronic Colloquium on Computational Complexity for the latest papers in the field.

Psuedorandomness

Design and Analysis of Algorithms

  1. Algorithm Design: Jon Kleinberg and √Čva Tardos
  2. Algorithms by Jeff Erickson
  3. Approximation Algorithms: Vijay V Vazirani
  4. Randomized Algorithms: Prabhakar Raghavan and Rajeev Motwani

Algebra

  1. An assortment of lecture notes on various topics is maintained by Andrew Kobin

Lectures and Miscellaneous Videos

Blogs. Podcasts and Websites