The interdicplinary of Mathematics and Computer Science, Distinguisehed by its emphasis on mathemtical technique and rigour.
- Introductory Theoretical Computer Science
- Theoretical Computer Science Handbooks
- Computational Complexity
- Algorithms
- Logic and Foundational Mathematics
- Philosophy
- Physics
- Math/Logic Preliminaries
- Surveys
- Other Resources
- Talks
- Related Awesome Lists
- Useful Links
- Moore & Mertens. The Nature of Computation
- Wigderson. Mathematics and Computation: A Theory Revolutionizing Technology and Science
- O'Donnell. CS Theory Toolkit
- alternatively: bilibili
- Intro to Theoretical Computer Science
- Computability, Complexity & Algorithms. Georgia Institute of Technology
- Michael Sipser. Introduciton to Theory of Computation
- Hopcroft, Motwani & Ullman. Introduction to Automata Theory, Languages, and Computation
- Barak. Introduction to TCS
- Atallah & Blanton. Algorithms and Theory of Computation Handbook: General Concepts and Techniques
- Atallah & Blanton. Algorithms and Theory of Computation Handbook: Special Topics and Techniques
- Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity
- Handbook of Theoretical Computer Science. Volume B: Formal Methods and Semantics
- Arora & Barak. Computational Complexity: A Modern Approach
- Goldreich. Computational Complexity: A Conceptual Perspective
- Goldreich. P, NP, and NP-Completeness: The Basics of Computational Complexity
- Ogihara & Hemaspaandra. The Complexity Theory Companion
- Papadimitriou. Computational Complexity
- Fortnow. The Golden Ticket: P, NP, and the Search for the Impossible
- Aaronson. Quantum Computing Since Democritus
- Jukna. Boolean Function Complexity: Advances and Frontiers
- Clote & Kranakis. Boolean Functions and Computation Models
- Cutland. Computability: An Introduction to Recursive Function Theory
- Cooper. Computability Theory
- Davis. Computability and Unsolvability
- Papadimitriou. Turing: A Novel About Computation
- Petzold. The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine
- Soare. Recursively Enumerable Sets and Degree
- Odifreddi. Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers
- Knuth. Things a Computer Scientist Rarely Talks About
- Floyd & Bokulich. Philosophical Explorations of the Legacy of Alan Turing: Turing 100
- Aaronson. Why Should Philosophers Care About Computational Complexity Theory
- Aharonov & Vazirani, Is Quantum Mechanics Falsifiable? A Computational Perspective on the Foundations of Quantum Mechanics
- Krantz. Handbook of Logic and Proof Techniques for Computer Science
- Aho & Ullman. Foundations of Computer Science
- Tu Delft. Delftse Foundations of Computation
- Jeremy Kun. A Programmer's Introduction to Mathematics
It is already curated here.
- Rosen. Discrete Mathematics and Its Applications
- Rosen. Handbook of Discrete and Combinatorial Mathematics
- Gries & Schneider. A Logical Approach to Discrete Math
- Watrous. Quantum Computational Complexity
- Harrow & Ashley Montanaro. Quantum Computational Supremacy
- Cook. An Overview of Computational Complexity
- Fortnow & Homer. A Short History of Computational Complexity
- Goldreich. Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- Reingold. The Practice of Theory Research
- Reingold. Through the Lens of a Passionate Theoretician
- Blum. You and Your Research: An Advice to a Beginning Graduate Student
- Dijkstra. The Three Golden Rules for Successful Scientific Research
- Goldreich. Essays and Opinions
- Barak. Advice for The Budding Theorist
- Barak. Surveys For Students
- Barak. Non-technical or Less-technical Writings and Talks
- Karp. A Personal View of Computer Science at Berkeley
- Hamming. You and Your Research
- Weinberg. Four Golden Lessons
- Terry. Career Advice
- The Legacy of Alan Turing: Pushing the Boundaries of Computation (Volume 18, Issue 3, Spring 2012). ACM, XRDS.
- SIGACT News
- Foundations and Trends in Theoretical Computer Science
- TCS+
- Turing Lectures. ACM
- ACM A.M. Turing Laureate Interview. Berekely
- Berkeley in the 80s
- Berkeley's Public Lectures
- Algorithms
- Mathematics (free lecture notes)
- Cryptography
- Quantum Computing