CSE525: Randomized Algorithms and Probabilistic Analysis

Catalog Description: Examines algorithmic techniques: random selection, random sampling, backwards analysis, algebraic methods, Monte Carlo methods, and randomized rounding; random graphs; the probabilistic method; Markov chains and random walks; and analysis tools: random variables, moments and deviations, Chernoff bounds, martingales, and balls in bins. Prerequisite: CSE 521 or equivalent; CSE majors only.

Prerequisites: CSE 521 or equivalent
Credits: 4.0

Portions of the CSE525 web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly creditied. The CSE525 Web: © 1993-2017, Department of Computer Science and Engineering, Univerity of Washington. Administrative information on CSE525 (authentication required).