Portland-State-University 2021-2022 Bulletin

CS 480 Randomized Algorithms and Probabilistic Analysis

Probabilistic tools used in the design and analysis of modern algorithms and data structures. Topics include: review discrete random, occupancy problems, tail bounds, Markov chains, the probabilistic method, martingales, Monte Carlo methods. The course explores a variety of CS applications.




CS 350, Stats 451.
  • Up one level
  • 400