First
and Second Course in Randomized Algorithms. Columbia. - Respectively, undergrad and grad courses for probabilistic methods in algorithms.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
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.
-
Lee. Randomized Algorithms and Probabilistic Analysis. Washington. homes.cs.washington.edu
Topics include Discrete probability, High-dimensional geometry and statistics, Information and entropy, and Markov chains and convergence to equilibrium.
-
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…
-
Alon & Spencer. The Probabilistic Method wiley.com
A standard reference for researchers in probabilistic methods in combinatorics. Shows also connections to theoretical computer science.
-
-
Algorithms, Part II coursera.org
Theoretical Computer Science › Randomization & Probability > Lecture Notes: “and Second Course in Randomized Algorithms. Columbia. - Respectively, undergrad and grad courses for probabilistic methods in algorithms.”