Preprints and papers
- Electronic Colloquium on Computational Complexity
- arXiv.org (mirror)
- Cryptology ePrint Archive
- ACM Digital Library
- IEEE Computer Society Digital Library
- SIAM Journals Online
- Science Direct
- Springer Link
- American Mathematical Society
Seminars and Workshops
- CS Theory @ Princeton : Seminars
- MIT Theory of Computation (TOC) Seminars
- Berkeley Theory Seminar
- Harvard Theory of Computation Seminar
- CMU Aladdin Seminar
- Technion CS Theory Seminar
- Schloss Dagstuhl
- DIMACS
- Center for Computational Intractability
Blogs
- Scott Aaronson
- Lance Fortnow, William Gasarch
- Oded Goldreich
- Timothy Gowers
- Gil Kalai
- James Lee
- Richard Lipton
- Michael Mitzenmacher
- Yoshio Okamoto
- Terence Tao
- Luca Trevisan
- Theory of Computing Blog Aggregator
- MathOverflow
- The polymath blog
- Theoretical Computer Science - Stack Exchange
- Tricki
References
- DBLP
- CiteSeer.IST
- Erik Demaine's List of Events
- Farshi - Conferences
- Accepted Papers at CS Theory Conferences
- Complexity Zoo
- Quantum Algorithm Zoo
- A compendium of NP optimization problems
- Information on the SAT problem
- Graph classes in ISGCI
- Theory Matters
- Mathworld
- Mathematica Online Integrator
Lecture notes and surveys
- Sanjeev Arora (Complexity, Combinatorics for CS)
- Boaz Barak (Complexity, Cryptography)
- Andrej Bogdanov (Complexity)
- Irit Dinur (Harmonic Analysis, Inapproximability)
- Oded Goldreich (Complexity, Cryptography)
- Ben Green (Additive Combinatorics, Harmonic Analysis)
- Venkatesan Guruswami (Coding, Inapproximability, Pseudorandomness)
- Subhash Khot (Harmonic Analysis, Inapproximability)
- Laszlo Lovasz (Random Walks, SDP)
- Marc Mezard (Random SAT, Statistical physics)
- Ryan O'donnell (Harmonic Analysis, Inapproximability)
- Toniann Pitassi (Machine Learning, Proof Complexity)
- Madhu Sudan (Algebra and Computation, Coding, Complexity)
- Terence Tao (Additive Combinatorics, Harmonic Analysis)
- Luca Trevisan (Coding, Complexity, Pseudorandomness, Inapproximability)
- Avi Wigderson (Expander graphs, Pseudorandomness)
- Uri Zwick (Boolean Circuit Complexity)
- MIT OpenCourseWare