COMP_SCI 396, 496: Randomized Algorithms VIEW ALL COURSE TIMES AND SESSIONS Prerequisites 336 or Permission of the instructor, ... several algorithms have been designed which crucially use randomness ...

As with all "classic algorithms," its output was deterministic: it produced the same result for the same input every time. It would always finish, and it always produced the optimal, correct result.

Many practical algorithms make random choices to achieve their objectives more efficiently; in a series of groundbreaking studies in the 1990s, Wigderson and his collaborators showed that ...