Science
Science: physics, biology, chemistry, astronomy and space, neuroscience, and research explained.
-
Breaking simple quantum position verification protocols with little entanglement (2020) arxiv.org
Considers the case when the input bases are related by different angles and shows dimension-dependent attacks depending on the angle. Notably, they show the angle $\pi/6$ (outside the Clifford hierarchy) can be attacked with a 6-dimensional resource state.
-
Constraining the doability of relativistic quantum tasks (2019) arxiv.org
Generalises the port-based attack to more general quantum tasks and spacetime circuits. Finds that the coarse causal structure of the task is the relevant property determining whether the task is doable non-locally.
-
A tight lower bound for the BB84-states quantum-position-verification protocol (2015) arxiv.org
Gives essentially tight lower bound for attacks with classical communication.
-
Zhou. A Theorist's Toolkit. Illinois yuanz.web.illinois.edu
It covers a large number of the math/CS topics that you need to know for reading and doing research in Computer Science Theory.
-
TCS+ youtube.com
A series of online seminars in theoretical computer science. The goal is to make engaging talks accessible to the widest possible audience.
-
O'Donnell. Great Ideas in Theoretical Computer Science. CMU youtube.com
A series of lectures on selected notable topics in theoretical computer science.
-
O'Donnell. CS Theory Toolkit youtube.com
It covers a large number of the math/CS topics that you need to know for reading and doing research in Computer Science Theory - alternatively: bilibili
-
Uni Paderborn. Quantum Complexity Theory. Winter 2020 youtube.com
CS Masters level lectures on topics including Boson sampling, quantum interactive proofs, and quantum merlin arthur.
-
Anil Ada. Great Ideas in Theoretical Computer Science. CMU youtube.com
A series of lectures on selected notable topics in theoretical computer science.
-
Yanofsky. Theoretical Computer Science youtube.com
undergrad introduction to theory of computation
-
CMU Theory youtube.com
Aims for a mathematical understanding of fundamental issues in Computer Science, and to use this understanding to produce better algorithms, protocols, and systems, as well as identify the inherent limitations of efficient computation.
-
Karp. A Personal View of Computer Science at Berkeley www2.eecs.berkeley.edu
Karp addresses: In 1968 computer science at Berkeley was problematic, with two departments working independently to develop programs, and his personal reflections.
-
Barak. Advice for The Budding Theorist windowsontheory.org
Tips for anyone interested in theoretical computer science.
-
Alon & Spencer. The Probabilistic Method wiley.com
A standard reference for researchers in probabilistic methods in combinatorics. Shows also connections to theoretical computer science.
-
Knuth. Things a Computer Scientist Rarely Talks About web.stanford.edu
A general illustration of relations between faith and science.
-
Intro to Theoretical Computer Science udacity.com
It teaches basic concepts in theoretical computer science, such as NP-completeness, and what they imply for solving tough algorithmic problems.
-
Tim Roughgarden. Foundations of Blockchains timroughgarden.github.io
The science and technology of blockchain protocols and the applications built on top of them, with an emphasis on fundamental principles rather than specific protocols. - See also Lecture Videos.
-
-
Barak. Surveys For Students thmatters.wordpress.com
Surveys for high-school, undergraduate, and even researchers.
-
Omer Reingold. TOC: a Personal Perspective (2021) theorydish.blog
In celebration of 25 years for “TOC: a Scientific Perspective (1996),” by Oded Goldreich and Avi Wigderson. It spots the light on a criticism directed to TCS, that it is not as deep as Math and not as useful as CS.
-
6.893 Philosophy and Theoretical Computer Science. MIT stellar.mit.edu
It examines the relevance of modern theoretical computer science to traditional questions in philosophy, and conversely, what philosophy can contribute to theoretical computer science.
-
Comprehensive Mathematics for Computer Scientists springer.com
A series dedicated to math topics and their relevance to computer science.
-
Floyd & Bokulich. Philosophical Explorations of the Legacy of Alan Turing: Turing 100 springer.com
Turing’s place in the history and philosophy of science.
-
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.
-
Simons' Institute simons.berkeley.edu
Programs, Events, and workshops, that aim toward maximizing impact and engagement across the theoretical computer science community.
-
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…
-
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.
-
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.
-
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.
-
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.
-
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, Abel & Chapman. Mathematics for Computer Science ocw.mit.edu
A junior introduction to discrete mathematics for computer scientists. - Companion Textbook 2015
-
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.
-
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.
-
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
-
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.
-
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.
-
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.
-
Paluszynski. Calculus for Computer Scientists math.uni.wroc.pl
calculus lecture notes taught for undergrad computer science students
-
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.
-
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.
-
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.
-
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.
- next page of items loading…
