Computer Science
7,622 items in 38 lists
-
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.
-
Donald Knuth 1 youtube.com
| Donald Knuth 2 | Silvio Micali | Richard Karp | Scott Aaronson 1 | Scott Aaronson 2
-
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.
-
Parametarized Algorithms by Warsaw youtube.com
-
ACM ByteCast youtube.com
Researchers, practitioners and innovators who are at the intersection of research and practice, sharing their experiences, lessons, visions for the future.
-
Turing Laureates Lectures youtube.com
and Turing Laureates Interviews - ACM Turing Award Laureates delivers a lecture before a forum of their choice on a subject of their choice.
-
O'Donnell. Graduate Complexity Theory youtube.com
It covers most of what is believed to be known to get started in complexity theory research.
-
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
-
O'Donnell. Undergrad Complexity Theory. Fall 2019 (15-455) youtube.com
(Homework) - Undergraduate course on computational complexity theory; It follows the same spirit of Sipser's part III.
-
Simons' Theory Shorts youtube.com
Short accessible videos which populate theory of computation.
-
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.
-
Berkeley in the 80s youtube.com
Interviews with eminent figures in Berkeley.
-
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
-
Luke Postle. Probablistic Methods. Waterloo youtube.com
-
Graph Theory by Waterloo youtube.com
-
Computational Complexity youtube.com
Collection of workshops.
-
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.
-
Goldreich. Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali wisdom.weizmann.ac.il
It explains the remarkable work of Shafi and Silvio and their works' implications on foundations of cryptography.
-
Goldreich. Randomized Methods in Computation wisdom.weizmann.ac.il
The aim of the current course is to make the students familiar with some of randomized methods.
-
Goldreich. Essays and Opinions wisdom.weizmann.ac.il
Personal Essays by Oded Goldreich. They are very unique in their conceptual message of TCS and its community.
-
Goldreich. Computational Complexity: A Conceptual Perspective wisdom.weizmann.ac.il
A grad introduction to computation complexity theory, emphasizing the idea behind concepts of complexity theory.
-
Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness wisdom.weizmann.ac.il
An introduction to the interwoven domains of cryptography, proofs and randomness.
-
Goldreich. P, NP, and NP-Completeness: The Basics of Computational Complexity wisdom.weizmann.ac.il
A very gentle introduction to some fundamental ideas of computational complexity like NP-completeness and P vs NP.
-
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.
-
Jukna. Extremal Combinatorics web.vu.lt
Combinatorial techniques written largely with an eye to their applications in TCS, and mostly in complexity
-
Knuth. Things a Computer Scientist Rarely Talks About web.stanford.edu
A general illustration of relations between faith and science.
-
Gregory Valiant. The Modern Algorithmic Toolbox. Stanford web.stanford.edu
It covers hashing, dimension reduction, linear and convex programming, gradient descent and regression, sampling and estimation, compressive sensing, linear-algebraic techniques (principal components analysis, singular value decomposition, spectral techniques), and an intro to…
-
Mary Wootters. Randomized Algorithms and Probabilistic Analysis. Stanford web.stanford.edu
Key tools of probabilistic analysis, and application of these tools to understand the behaviors of random processes and algorithms. Emphasis is on theoretical foundations, though applications will be discussed in machine learning and data analysis, networking, and systems…
-
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.
-
Computability, Complexity & Algorithms. Georgia Institute of Technology udacity.com
It focuses on the big fundamental questions of computing, and how understanding the power and limitations of algorithms helps us develop the tools to make real-world computers smarter, faster and safer.
-
Du & Ko. Design and Analysis of Approximation Algorithms u.pcloud.link
A technique-oriented approach provides a unified view. It includes detailed algorithms, proofs, analyses, examples, and applications from research papers.
-
Vijay Vazirani. Approximation Algorithms u.pcloud.link
-
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.
-
Theory of Computing Blog Aggregator theory.report
A blog Aggregator for all blogs related to TCS.
-
Arora & Barak. Computational Complexity: A Modern Approach theory.cs.princeton.edu
A golden standard textbook, Surveying computational complexity theory for graduate students and researchers.
-
Terry. Career Advice terrytao.wordpress.com
A collection of various pieces of advice on academic career issues in mathematics, roughly arranged by the stage of career at which the advice is most pertinent.
-
Rosen. Handbook of Discrete and Combinatorial Mathematics taylorfrancis.com
A complete survey of roughly all topics of discrete math and their relevance to computing and communication engineering.
-
Feynman. Feynman And Computation: Exploring The Limits Of Computers taylorfrancis.com
-
Indyk & Daskalakis. Learning-augmented Algorithms. MIT stellar.mit.edu
-
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.
- next page of items loading…
