Select the desired Level or Schedule Type to find available classes for the course. |
CSCI 1550 - Probability and Computing: Randomized Algorithms and Probabilistic Analysis |
This course introduces students to applications of probabilistic and statistical methods to the design and analysis of algorithms, in particular randomized algorithms and probabilistic analysis of algorithms. The course covers basic probabilistic techniques such as tail bounds, martingales, coupling, etc., and presents applications of randomized and probabilistic analysis techniques in areas such as graph algorithms, data structures, communication, and Monte Carlo simulations. No prior knowledge of probability theory is assumed. CSCI 1570 recommended but not required.
1.000 Credit hours 1.000 Lecture hours Levels: Graduate, Undergraduate Schedule Types: Primary Meeting Computer Science Department Prerequisites: Undergraduate level CSCI 0220 Minimum Grade of S |
Return to Previous | New Search |