Tim Roughgarden's Lecture Notes
Disclaimer: Some of these notes have been edited more than others. Request for feedback: I always appreciate suggestions and corrections from readers. Home
Tim Roughgarden's Lecture Notes Lecture Notes (Click on one of the following courses to expand.) Foundations of Blockchain Protocols (COMS 6998, spring 2021) Lecture 1: Introduction and Overview Lecture 2: The Dolev-Strong Protocol   [very rough draft] Lecture 3: Simulation, Indistinguishability, and the Necessity of PKI   [very rough draft] Lectures 4 and 5: The Asynchronous Model and the FLP Impossibility Theorem   [very rough draft] Lecture 6: The Partially Synchronous Model, 33%, and the CAP Principle   [very rough draft] Lecture 7: The Tender
saved by
related reading
- Pen and Paper Exercises in Machine Learningarxiv.org
- Algorithmic Game Theory (CS364A), Fall 2013timroughgarden.org
- HSRGnotes.ekzhang.com
- Understanding Deep Learningudlbook.github.io
- Algorithms for Modern Hardware - Algorithmicaen.algorithmica.org
- 6.5840 Schedule: Spring 2026pdos.csail.mit.edu
- MathofSNLnotes2025.pdfpeople.math.ethz.ch
- CSE290A - Randomized Algorithmsusers.soe.ucsc.edu
- An intensive introduction to cryptography: indexintensecrypto.org
- 15-855: Graduate Computational Complexity Theory, Fall 2017cs.cmu.edu
- 15-859T: A Theorist's Toolkit 2013cs.cmu.edu
- COMP 598 Fall 2020 - Proof Complexitycs.mcgill.ca