Average-Case Complexity Forum - Provides an overview, including surveys and a bibliography, of recent work on average-case complexity analysis.
CAC-NET/FoCM-NET - Archives and membership information of an electronic forum for researchers in Continuous Algorithms and Complexity and in Foundations of Computational Mathematics.
Foundations of Computational Mathematics - A group which sponsors regular meetings on the relationships between mathematical analysis, topology, geometry and algebra and the computational process.
Information-Based Complexity Home Page - Provides information on computational complexity problems in the presence of partial or contaminated information and links to researchers in this field.
An Introduction to the Theory of Computation - An online text aimed at advanced undergraduate and graduate students. Chapters include Finite-Memory Programs, Recursive Finite-Domain Programs, General Programs, Resource Bounded Computation, Probabilistic Computation, and Parallel Computation.
P vs NP - Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute.
SIGACT News Theory Calendar - A calendar of upcoming theoretical computer science events and a list of recently released books in the field.
Theory of Computation - Lecture notes for an undergraduate class taught by Leonid Levin at UC Berkeley.
The Types Forum - Archives and subscription information for this moderated mailing list which focuses on semantical, categorical, operational, and proof theoretical topics relating to type theory.
Virtual Turing Machine 2 - Simulates a Turing machine. Users can write their own Turing machines and see their machines work.
- A directory of resources related to theoretical computer science from Stanford University.