Aspnes. Notes on Randomized Algorithms
Supplemental notes to the standard books by Mitzenmacher & Upfals, and Motwani & Raghavan.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Aspnes. Notes on Discrete Mathematics cs.yale.edu
Fall 2017 of the Yale course CPSC 202a, Mathematical Tools for Computer Science.
-
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.
-
Indyk & Daskalakis. Learning-augmented Algorithms. MIT stellar.mit.edu
-
Gupta & Ravi. Approximation Algorithms. CMU cs.cmu.edu
It includes convex programming-based, randomness, and metric methods.
-
Arora. Advanced Algorithm Design cs.princeton.edu
Notably uses ideas such as randomness, approximation, high dimensional geometry. Faces uncertainty, approaches to handle big data, handling intractability, heuristic approaches, ..etc.
-
First cs.ubc.ca
and Second Course in Randomized Algorithms. Columbia. - Respectively, undergrad and grad courses for probabilistic methods in algorithms.
Theoretical Computer Science › Randomization & Probability > Lecture Notes: “Supplemental notes to the standard books by Mitzenmacher & Upfals, and Motwani & Raghavan.”