Computer Science
7,622 items in 38 lists
-
Jukna. Boolean Function Complexity: Advances and Frontiers springer.com
A modern textbook surveying circuit complexity.
-
Ogihara & Hemaspaandra. The Complexity Theory Companion springer.com
An accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory.
-
Soare. Recursively Enumerable Sets and Degree springer.com
It gives a complete account of the theory of r.e degrees. The definitions, results and proofs are always clearly motivated and explained before the formal presentation; the proofs are described with remarkable clarity and conciseness.
-
Clote & Kranakis. Boolean Functions and Computation Models springer.com
An introduction to circuit complexity, boolean functions, and computation models.
-
Oberguggenberger & Ostermann. Analysis for Computer Scientists: Foundations, Methods, and Algorithms springer.com
Presents an algorithmic approach to mathematical analysis, with a focus on modelling and on the applications of analysis.
-
Floyd & Bokulich. Philosophical Explorations of the Legacy of Alan Turing: Turing 100 springer.com
Turing’s place in the history and philosophy of science.
-
Mariconda & Tonolo. Discrete Calculus: Methods for Counting springer.com
An introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find also deep insights into a range of less common topics rarely considered within a single book.
-
Pudlák. Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction springer.com
Presents a wide range of results in logic and computational complexity.
-
Rosenberg & Trystram. Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students… springer.com
It endows the reader with an operational conceptual and methodological understanding of discrete mathematics for computing
-
Makinson. Sets, Logic and Maths for Computing springer.com
It presents a careful selection of the material most needed by students in their first two years studying computer science.
-
Vince. Foundation Mathematics for Computer Science: A Visual Approach springer.com
A range of mathematical topics to provide a solid foundation for an undergraduate course in computer science, starting with a review of number systems and their relevance to digital computers, and finishing with differential and integral calculus.
-
Yves Nievergelt. Logic, Mathematics, and Computer Science: Modern Foundations with Practical Applications springer.com
For lower undergraduates, It introduces the reader to logic, proofs, sets, and number theory, Focusing on foundations. It provides complete details and derivations of formal proofs.
-
Ben-Ari. Mathematical Logic for Computer Science springer.com
Semantic tableaux are used because they are theoretically sound and easy to understand.
-
Shasha & Lazere. Out of their Minds: The Lives and Discoveries of 15 Great Computer Scientists springer.com
Interviews with era's greatest scientists about their inspirations, discoveries, and personal interests.
-
Gries & Schneider. A Logical Approach to Discrete Math springer.com
It attempts to change the way we teach logic to beginning students. Instead of teaching logic as a subject in isolation, we regard it as a basic tool and show how to use it.
-
UW CSE505 18au Principles of PL sites.google.com
Techniques for thinking crisply about programming languages, write some fascinating programs, and discuss various design tradeoffs.
-
Simons' Institute simons.berkeley.edu
Programs, Events, and workshops, that aim toward maximizing impact and engagement across the theoretical computer science community.
-
ACM's SIGACT sigact.org
-
Part I scottaaronson.com
& Part II - Part I: Presuppose only linear algebra and a bit of classical algorithms. Topics include quantum circuits, density matrices, entanglement entropy, Wiesner’s quantum money, QKD, quantum teleportation, the Bell inequality, interpretations of QM, the Shor 9-qubit code…
-
Aaronson. Why Should Philosophers Care About Computational Complexity Theory scottaaronson.com
It argues that computational complexity theory leads to new perspectives on the nature of mathematical knowledge and other philosophical questions.
-
Demaine. Games, Puzzles, and Computation routledge.com
It shows that games and puzzles can serve as powerful models of computation, Offering a new way of thinking about computation.
-
Cooper. Computability Theory routledge.com
A concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results.
-
Atallah & Blanton. Algorithms and Theory of Computation Handbook: Special Topics and Techniques routledge.com
A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.
-
Atallah & Blanton. Algorithms and Theory of Computation Handbook: General Concepts and Techniques routledge.com
A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.
-
Lipton & Regan rjlipton.wpcomstaging.com
A list of theory blogs for computer science.
-
Aharonov & Vazirani, Is Quantum Mechanics Falsifiable? A Computational Perspective on the Foundations of Quantum… researchgate.net
It describes how quantum mechanics can be tested in the limit of high complexity regime by extending the usual scientific paradigm to include.
-
Fortnow & Homer. A Short History of Computational Complexity researchgate.net
A historical overview of computational complexity.
-
TCS Subreddit reddit.com
Theoretical computer science's subreddit.
-
Building Bridges I rd.springer.com
, Building Bridges II, Fete of Combinatorics and Computer Science - Collected works in celebration of Laszlo Lovasz, Connecting discrete math with computer science.
-
Martin-Löf. Intuitionistic Type Theory raw.githubusercontent.com
Notes by Giovanni Sambin of a series of type theory lectures given in Padua, June 1980.
-
Quanta Magazine quantamagazine.org
Features breakthroughs in the field, written in an accessible style for non-experts.
-
Stanford Encyclopedia of Philosophy. Computational Complexity Theory plato.stanford.edu
The foundations of complexity theory, and its potential significance on philosophy of computer science, philosophy of mathematics and epistemology.
-
Jeremy Kun. A Programmer's Introduction to Mathematics pimbook.org
Uses your familiarity with ideas from programming and software to teach mathematics.
-
Madhu Sudan. Essential Coding Theory people.seas.harvard.edu
Some elements of Algorithmic tasks of encoding and decoding and its connections with error-correction; These codes are now tools in the design and analysis of algorithms, and also in many aspects of computational complexity. The focus is on constructions of algorithmic and…
-
Moitra. Theoretical Foundations for Deep Learning. MIT people.csail.mit.edu
It explores theoretical foundations for deep learning, emphasizing the following themes: (1) Approximation: What sorts of functions can be represented by deep networks, and does depth provably increase the expressive power? (2) Optimization: Essentially all optimization…
-
Papadimitriou. Computational Complexity pearson.com
Body of knowledge for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the structural…
-
Hopcroft, Motwani & Ullman. Introduction to Automata Theory, Languages, and Computation pearson.com
Introductory undergrad textbook for automata, languages and theory of computation topics.
-
Knuth, Graham & Patashnik. Concrete Mathematics: A Foundation for Computer Science pearson.com
An expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply.
-
Zhu & Ko. Problem Solving in Automata, Languages, and Complexity onlinelibrary.wiley.com
A problem-set text for automata, languages, and complexity.
-
Omer Reingold. The Practice of Theory Research omereingold.wordpress.com
A research methods course, concentrating on the how rather than the what. It focuses on research practices common for computer science theory research.
-
Demaine. Algorithmic Lower Bounds: Fun with Hardness Proofs ocw.mit.edu
A class taking a practical approach to proving problems can't be solved efficient.
-
Erik Demaine. Advanced Data Structures. MIT ocw.mit.edu
It covers major results and current directions of research in data structure.
-
Demaine, Abel & Chapman. Mathematics for Computer Science ocw.mit.edu
A junior introduction to discrete mathematics for computer scientists. - Companion Textbook 2015
-
Demaine/Devadas/Lynch. Design and Analysis of algorithms. MIT ocw.mit.edu
A second course on algorithms and data structures. — added by Erik himself!
-
Demaine/Ku/Soloman. Introduction to Algorithms. MIT ocw.mit.edu
A first course on basic algorithms and data structures. — added by Erik himself!
-
MIT OCW ocw.mit.edu
, HTML book, Byford's playlist, Javascript book, Python book, Berkeley for self-study, and Berkeley 2024 - Fundamental principles of computer programming in Scheme, including recursion, abstraction, modularity, and programming language design and implementation.
-
Kelner. Topics in Theoretical Computer Science: An Algorithmist's Toolkit. MIT ocw.mit.edu
It covers a collection of geometric techniques that apply broadly in modern algorithm design.
-
Yufei. Probabilistic Methods in Combinatorics. MIT ocw.mit.edu
and Yufei's Graph Theory book - Showing some combinatorial object exists and prove that a certain random construction works with positive probability. The course focuses on methodology as well as combinatorial applications.
-
Foundations and Trends in Theoretical Computer Science nowpublishers.com
It provides monographs written by leaders that give tutorial coverage of subjects, research retrospectives as well as survey papers that offer state-of-the-art reviews fall within the scope of the journal.
-
Weinberg. Four Golden Lessons nature.com
Lessons for students and researchers given by Steven Weinberg.
- next page of items loading…
