UI Wordmark

CS 574 RA - Randomized Algorithms

Campus: Urbana-Champaign

Description:

Basic and advanced concepts in the design and analysis of randomized algorithms. Sampling; concentration inequalities such as Chernoff-Hoeffding bounds; probabilistic method; random walks, dimension reduction; entropy; martingales and Azuma's inequality; derandomization. Randomized algorithms for sorting and searching; graphs; geometric problems. Basics of pseudorandomness and randomized complexity classes. Course Information: Prerequisite: CS 473; MATH 461 or STAT 400.

Special Instructions:

Academic Program Restrictions:

MCS:Computer Sci Online -UIUC

Option 1

Number of Required Visit(s): 0

Course Level: Graduate

Credit: 4

Term(s): Spring


Home

Bachelor's Degree

Master's Degree

Doctoral Degree

Certificates

Continuing Education

Search Programs

Search Courses

FAQ

Contact Us


University of Illinois Online
Phone: (866) 633-8465 - Join Us  Facebook
© Copyright 2015 - University of Illinois

Cookie Settings