COMP 490
3 credits
Introduction to Probabilistic Analysis of Algorithms

Computer Science (Sci): Fundamental tools from probability are used to analyze algorithms. Notions covered included independence, generating functions, probability inequalities, random walks and Markov chains. Analysis of probabilistic recurrences, Las Vegas algorithms, randomized approximation algorithms, random sampling methods, Monte Carlo techniques and algorithms for combinatorial search and graph theoretic problems.

Offered by: Computer Science