Skip to main content.



Course Search

Search Results

Course Prefix: CSE   Course #: 694   Keywords:     showing 0 to 1

CSE 694LEC Topics in Algorithms


Probabilistic analysis and randomized algorithms have become an indispensible tool in virtually all areas of Computer Science, ranging from combinatorial optimization, machine learning, data streaming, approximation algorithms analysis and designs, complexity theory, coding theory, to communication networks and secured protocols. This course has two major objectives: (a) it introduces key concepts, tools and techniques from probability theory which are often employed in solving many Computer Science problems, and (b) it presents many examples from three major themes: computational learning theory, randomized/probabilistic algorithms, and combinatorial constructions and existential proofs.

Credits: 3
Grading: Graded (GRD)
Typically Offered: Varies
Visit the Office of the Registrar’s Class Schedules page for more detailed and updated information.
Published: May 23, 2022 11:45:07