Graduate Course Descriptions

The following directory lists the graduate courses which the University expects to offer, although the University in no way guarantees that all such courses will be offered in any given academic year, and reserves the right to alter the list if conditions warrant. Click on the links below for a list of courses in that subject area. You may then click “View Classes” to see scheduled classes for individual courses.

6512. Randomization in Computing

3.00 credits

Prerequisites: Prerequisite: CSE 5500. Open to graduate students in the CSE program, others with permission. (RG 3877)

Grading Basis: Graded

Introduction to the theory and practice of randomization and randomized algorithms as a technique for science and engineering problem solving. Topics to be covered include: probability theory, types of randomization, sorting and selection, hashing and skip list, finger-printing, packet routing, geometry and linear programming, graph algorithms, combinatorial optimization, and external memory algorithms.

No classes found.