Awesome Theoretical Computer Science

URL: https://github.com/mostafatouny/awesome-theoretical-computer-science#readme
Category: Themed Directories
Tags: computer-science, math, awesome-lists

Description

A curated “awesome list” of resources in theoretical computer science, focusing on mathematically rigorous material at the intersection of mathematics and computer science. The directory aggregates textbooks, lecture notes, MOOCs, video playlists, problem sets, and handbooks with an emphasis on proofs, logic, and formal techniques.

Features

• Curated awesome list format

  • Organized as an open-source GitHub repository.
  • Follows the Awesome list conventions and badge.

• Emphasis on mathematical rigor

  • Prioritizes resources distinguished by proof-based, logical, and formal methods.
  • Targets readers interested in the mathematical foundations of computer science.

• Broad Introductions to TCS

  • High-level “Broad Intros” section to orient newcomers.
  • Subsections (as indicated):
    • Lecture Notes
    • Lecture Video Playlists
    • Books
    • Handbooks

• Theory of Computation coverage

  • Introductory materials
    • Lecture Notes
    • MOOCs
    • Books
    • Puzzles and Problem Sets
  • Computational Complexity
    • Introductory level
      • Lecture Video Playlists
      • Lecture Notes
      • Books
      • “Big Lists” of references/resources
  • Communication Complexity
    • Lecture Notes
    • Books
  • Circuit Complexity
    • Books
  • Quantum Complexity
    • Lecture Video Playlists
    • Lecture Notes
  • Proof Complexity
    • Lecture Notes
  • Computability Theory
    • Books categorized as:
      • Introductory
      • Advanced
      • Monographs

• Logic-related TCS resources

  • Logic section with focus on:
    • Computational complexity within logic
      • Books (as a dedicated subsection)

• Programming Language Theory (PLT)

  • Basics
    • Lecture Notes
    • Books
  • Introductory PLT
    • Books
  • Formal Verification
    • Lecture Notes
    • Books
  • Type Theory
    • Lecture Notes
    • Books
  • Functional Programming
    • Lecture Notes

• Algorithms

  • General algorithms
    • Lecture Videos
    • Lecture Notes
    • Books
  • Lower bounds in algorithms/complexity
    • (Section present; detailed items listed in the README beyond the provided excerpt.)

• Open contribution model

  • Repository includes contributing.md for guidelines on adding or updating resources.
  • Community-maintained and extensible.

• Repository structure & assets

  • README.md with the full curated list and table of contents.
  • Banner image (TCS-banner.png) for visual identification.
  • License file (LICENSE) specifying reuse terms.
  • Additional tooling (big_list_builder directory) to help manage or generate the large list.

Pricing

• Not a paid product or service.
• All listing and access are free; subject only to the licenses of the linked external resources.

License

• A dedicated LICENSE file is included in the repository.
• Users should refer directly to that file for exact licensing terms and reuse conditions, as well as check licenses of individual linked resources.