Mary Wootters. Randomized Algorithms and Probabilistic Analysis. Stanford
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…
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
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.
-
Arora. A Theorist's Toolkit. Princeton cs.princeton.edu
Aimed primarily at first and second year graduate students who plan to do research in theoretical computer science. We will introduce probabilistic, algebraic, combinatorial, and algorithmic methods useful in proofs.
-
First cs.ubc.ca
and Second Course in Randomized Algorithms. Columbia. - Respectively, undergrad and grad courses for probabilistic methods in algorithms.
-
Alon & Spencer. The Probabilistic Method wiley.com
A standard reference for researchers in probabilistic methods in combinatorics. Shows also connections to theoretical 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.
-
Koutsoupias. Probability and Computing. Oxford cs.ox.ac.uk
Introduction to probabilistic methods in computer science.
Theoretical Computer Science › Randomization & Probability > Lecture Notes: “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…”