Web-logs:
CCC Blog,
Luca Trevisan,
Lance Fortnow and Bill Gasarch,
Michael Mitzenmacher,
Richard Lipton,
Terry Tao,
Noam Nisan,
Oded
Goldreich,
Scott Aaronson
Journals:
JACM,
SICOMP,
CC,
ToC,
TCS,
ToCT,
Inf. Comp.,
JCSS
Conferences and Workshops:
FOCS, STOC, CCC, RANDOM, STACS, ICALP, ...,
Midwest Theory Day
Other Online Papers, Events:
ECCC,
SIGACT News Complexity Theory Column,
BEATCS Complexity Theory Column,
Center for Computational Intractability,
UW-Madison Theory group
Lecture Notes, Draft Texts, etc.:
Free online texts/drafts,
Complexity Zoo,
Complexity Theory (Van Melkebeek),
Complexity Theory (Cai),
Complexity Theory: A Modern Approach (Arora and Barak),
Computational
Complexity: A Conceptual Perspective (Goldreich),
Harmonic Analysis (Van Melkebeek),
Expander Graphs (Van Melkebeek),
PCP's and Hardness of Approximation (Van Melkebeek),
A Computational Introduction to Number Theory and Algebra
(Shoup)
Advocacy Groups, Retrospectives, Visions for the Future, etc.:
Theory Matters,
ACM SIGACT,
Visions for Theoretical Computer Science 2009 (PPT),
Computational
Complexity Since 1980 (PS, Impagliazzo),
Hilbert's
Problems,
Knowledge, Creativity and P versus NP
For Fun:
A proof that the Halting Problem is undecidable,
PhD Comics,
xkcd comics,
Math Genealogy
(grapher,
UW Theory Group professors'
genealogy graph)
