Spring 2024 - Randomized Algorithms. A little randomness is a surprisingly powerful ingredient in algorithm design. Sometimes this amounts to producing approximate solutions to a problem where exact global solutions are forbiddingly hard to find, and other times the randomness itself--as a probability distribution--is the goal. This course will present some classic and some cutting-edge randomized algorithms, with an emphasis on discrete and graph-based problems.

Note that this information may change at any time. Please visit the MyBU Student Portal for the most up-to-date course information.