Math
Mathematics: proofs, geometry, calculus, linear algebra, probability, statistics, and math explained visually.
-
Algorithms, Part I coursera.org
-
Algorithms algs4.cs.princeton.edu
-
Algorithm Tutorials by Tanuj Khattar tanujkhattar.wordpress.com
-
See Algorithms see-algorithms.com
-
-
MIT - 6-006 ocw.mit.edu
-
Real World Algorithms: A Beginner's Guide mitpress.mit.edu
-
Introduction to Algorithms mitpress.mit.edu
-
Princeton DS Cheat Sheet algs4.cs.princeton.edu
-
Tim Roughgarden. Algorithms Illuminated algorithmsilluminated.org
-
-
-
-
How To Stop Hating Your Tests vimeo.com
-
The Journal of Mathematical Sociology tandfonline.com
-
Graph Theory (Mathematics) personal.psu.edu
-
-
CONTEST maths.strath.ac.uk
-
Mathematical Sociology Section of the American Sociological Association (ASA) mathematicalsociology.org
-
Computational and Mathematical Organization Theory link.springer.com
-
R / Notes: Networks f.briatte.org
-
A First Course in Network Science cambridge.org
-
Dynamical Processes on Complex Networks cambridge.org
-
Numeracy numeracy.co
Fast, clean SQL client and business intelligence.
-
Spark in Motion manning.com
Spark in Motion teaches you how to use Spark for batch and streaming data analytics.
-
Mahout Spark Bindings mahout.apache.org
[status unknown] - linear algebra DSL and optimizer with R-like syntax.
-
Data Science and Engineering with Apache Spark (edX XSeries) edx.org
Series of five courses (Introduction to Apache Spark, Distributed Machine Learning with Apache Spark, Big Data Analysis with Apache Spark, Advanced Apache Spark for Data Science and Data Engineering, Advanced Distributed Machine Learning with Apache Spark) covering different…
-
Geometry of Banach spaces: A new route towards position based cryptography (2021) doi.org
Provides a new protocol based on applying a phase unitary depending on the classical input information. Shows an exponential lower bound under a regularity assumption on the attack, and an exponential lower bound conditioned on an, as yet, unresolved Banach space geometry…
-
Monogamy of highly symmetric states (2023) arxiv.org
The results in this paper imply a $\ln(2) \approx 0.69$ upper bound on the success probability of unentangled attacks.
-
On the role of quantum communication and loss in attacks on quantum position verification (2022) arxiv.org
Proves a 3/4 upper bound on the success probability of unentangled attacks.
-
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
-
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.
-
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
-
Luke Postle. Probablistic Methods. Waterloo youtube.com
-
Graph Theory by Waterloo youtube.com
-
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.
-
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. Modern Cryptography, Probabilistic Proofs and Pseudorandomness wisdom.weizmann.ac.il
An introduction to the interwoven domains of cryptography, proofs and randomness.
-
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.
- next page of items loading…
