dogear

enter for all results · esc to close

Theoretical Computer Science

204 items from mostafatouny/awesome-theoretical-computer-science ★1,220

  1. TCS Subreddit reddit.com

    Theoretical computer science's subreddit.

  2. 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.

  3. 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.

    site link ↗
  4. Quanta Magazine quantamagazine.org

    Features breakthroughs in the field, written in an accessible style for non-experts.

    site link ↗
  5. 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.

  6. Jeremy Kun. A Programmer's Introduction to Mathematics pimbook.org

    Uses your familiarity with ideas from programming and software to teach mathematics.

  7. 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…

  8. 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…

  9. 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…

  10. Hopcroft, Motwani & Ullman. Introduction to Automata Theory, Languages, and Computation pearson.com

    Introductory undergrad textbook for automata, languages and theory of computation topics.

  11. 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.

  12. Zhu & Ko. Problem Solving in Automata, Languages, and Complexity onlinelibrary.wiley.com

    A problem-set text for automata, languages, and complexity.

    site link ↗
  13. 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.

  14. 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.

  15. Erik Demaine. Advanced Data Structures. MIT ocw.mit.edu

    It covers major results and current directions of research in data structure.

  16. Demaine, Abel & Chapman. Mathematics for Computer Science ocw.mit.edu

    A junior introduction to discrete mathematics for computer scientists. - Companion Textbook 2015

  17. Demaine/Devadas/Lynch. Design and Analysis of algorithms. MIT ocw.mit.edu

    A second course on algorithms and data structures. — added by Erik himself!

  18. Demaine/Ku/Soloman. Introduction to Algorithms. MIT ocw.mit.edu

    A first course on basic algorithms and data structures. — added by Erik himself!

  19. 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.

  20. 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.

  21. 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.

  22. 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.

  23. Weinberg. Four Golden Lessons nature.com

    Lessons for students and researchers given by Steven Weinberg.

    site link ↗
  24. Moore & Mertens. The Nature of Computation nature-of-computation.org

    It spans complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and of quantum computing. It provides accessible explanations

  25. Penna. Algorithmic Game Theory ml2.inf.ethz.ch

    The course discusses algorithmic aspects of game theory, such as a general introduction to game theory, auctions, mechanisms, the costs of a central control optimum versus those of an equilibrium under selfish agents, and algorithms and complexity of computing equilibria.

  26. Telgarsky. Deep Learning Theory. Illinois mjt.cs.illinois.edu

    Focuses on simplified proofs over what appears in the literature, and classical perspective of achieving a low test error for binary classification with IID data via standard (typically ReLU) feedforward networks.

  27. Papadimitriou. Turing: A Novel About Computation mitpress.mit.edu

    The world of computation according to Turing, an interactive tutoring program, as told to star-crossed lovers: a novel.

  28. Vazirani & Kearns. An Introduction to Computational Learning Theory mitpress.mit.edu

    Emphasizing issues of computational efficiency, It introduces a number of central topics in computational learning theory.

  29. Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity mitpress.mit.edu

    A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.

  30. Handbook of Theoretical Computer Science. Volume B: Formal Methods and Semantics mitpress.mit.edu

    A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.

  31. Copeland, Posy & Shagrir (editors). Computability: Turing, Gödel, Church, and Beyond mitpress.mit.edu

    Computer scientists, mathematicians, and philosophers discuss the conceptual foundations of the notion of computability as well as recent theoretical developments.

  32. Harry Lewis. Ideas That Created the Future: Classic Papers of Computer Science mitpress.mit.edu

    Classic papers by thinkers ranging from Aristotle and Leibniz to Norbert Wiener and Gordon Moore that chart the evolution of computer science.

  33. Rosen. Discrete Mathematics and Its Applications mheducation.com

    A canonical discrete math textbook, accessible for even high school students.

  34. Paluszynski. Calculus for Computer Scientists math.uni.wroc.pl

    calculus lecture notes taught for undergrad computer science students

  35. Wigderson. Mathematics and Computation: A Theory Revolutionizing Technology and Science math.ias.edu

    A sweeping survey of complexity theory, emphasizing the field’s insights and challenges. It explains the ideas and motivations leading to key models, notions, and results.

  36. Eck & Critchlow. Foundations of Computation math.hws.edu

    for a one-semester course in theoretical computer science. It has no prerequisites other than introductory computer programming. It includes logic, sets, and function from discrete math, and automata, formal languages, and grammar from upper-level courses.

  37. Krantz. Handbook of Logic and Proof Techniques for Computer Science maa.org

    A concise offered as an accessible reference on mathematical logic for the professional computer scientist.

  38. Hermann's Conferences in TCS lix.polytechnique.fr

    TCS Conferences collected in one table.

    site link ↗
  39. Dijkstra. The Three Golden Rules for Successful Scientific Research link.springer.com

    A note devoted to three rules that must be followed if you want to be successful in scientific research.

  40. Teuscher. Alan Turing: Life and Legacy of a Great. Springer link.springer.com

    Essays which spans the entire rich spectrum of Turing's life, research work and legacy.

  41. Ausiello. The Making of a New Science: A Personal Journey Through the Early Years of Theoretical Computer Science link.springer.com

    A story about people, pioneers with diverse backgrounds and characters who established a new field.

  42. Lindell. Tutorials on the Foundations of Cryptography link.springer.com

    Advanced tutorials appropriate for self-study by experienced researchers,

    site link ↗
  43. Sommaruga & Strahm. Turing’s Revolution: The Impact of His Ideas about Computability link.springer.com

    A collection of historical, technical and philosophical papers.

  44. Lacona. LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science link.springer.com

    Suitable for undergraduate introductions to logic and early graduate courses on logic.

  45. Susskind. Three Lectures on Complexity and Black Holes link.springer.com

    Important connections between thermodynamics and complexity are proposed and discussed. Pedagogically written, serves as a fundamental introduction to black holes and their complex physical interpretation

  46. Lean Proof Assistant lean-lang.org

    Lean Proof Assistant.

  47. Philip Davis. Toward a Philosophy of Computation jstor.org

    Philosophical implication of mathematization and computerization of the world.

  48. Vaughan. CS260: Machine Learning Theory jennwv.com

    A broad overview of the theoretical foundations underlying common machine learning algorithms.

  49. Barak. Introduction to TCS introtcs.org

    A modern, brief, and accessible text which introduces theoretical computer science for undergrads. It includes topics not usually included in standard undergrad text-books.

  50. next page of items loading…