COM SCI 289RA
Current Topics in Computer Theory: Randomized Algorithms
Computer Science · 4 units · Graduate courses (200-299)
Basic concepts and design techniques for randomized algorithms, such as probability theory, Markov chains, random walks, and probabilistic method. Applications to randomized algorithms in data structures, graph theory, computational geometry, number theory, and parallel and distributed systems.
Letter grading.
Requisites
UCLA lists no requisites for this course.
Requires
Everything that has to come before this course, not just the courses named in the requisite above.
Nothing — this is an entry point.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.