• UNM

Randomized Algorithms

CS 510 (3)

Introduction to probability theory, moments and deviation, tail inequalities, probabilistic method, Markov Chains and Random Walks, dynamic graph algorithms, data stream algorithms, and parallel and distributed algorithms.

Prerequisite: 500 and 530 and 561

---

Prerequisites / Corequisites

Introduction to the Theory of Computation - CS 500

Geometric and Probabilistic Methods in Computer Science - CS 530

Algorithms/Data Structure - CS 561

---