Randomized Algorithms

Subject: 
Computer Science (CS)
Catalog number: 
761
Unit weight: 
0.50
Meet type: 
LEC
Grading basis: 
NUM
Cross-listing(s): 
N/A
Requisites: 
N/A
Description: 
Introduction to the design and analysis of algorithms that make use of randomization. Topics include review of basic probabiloity and introduction to randomized algorithms; game theoretic techniques; uses of Markov and Chebyshev inequalities; tail inequalities; Markov chains and random walks; algebraic techniques; data structures and graph algorithms.
Topic titles: 
N/A
Faculty: 
Mathematics (MAT)
Academic level: 
GRD
Course ID: 
011296