MATH department

MATH 261B. Probabilistic Combinatorics and Algorithms II (4 units)

Link to catalog page: https://catalog.ucsd.edu/courses/MATH.html#math261b

Description

Introduction to probabilistic algorithms. Game theoretic techniques. Applications of the probabilistic method to algorithm analysis. Markov Chains and Random walks. Applications to approximation algorithms, distributed algorithms, online and parallel algorithms. MATH 261A must be taken before MATH 261B. Prerequisites: MATH 261A.

Prerequisite courses

Successor courses

MATH 261B is a prerequisite of the following 1 courses:

• MATH 261C