The power of randomness is one of the most enduring mysteries of computation. In the last 30+ years, several algorithms have been designed which crucially use randomness and beat their deterministic ...

and randomized algorithms. Important themes that will be developed in the course include the algorithmic abstraction-design-analysis process and computational tractability (e.g., NP-completeness).

We will learn how to analyze the complexity of the randomized quicksort/quickselect algorithms. We will learn open address hashing: a technique that simplifies hashtable design. Next we will study the ...

Algorithm Design Approaches: Divide and Conquer including analysis using recurrences Greedy Algorithms Dynamic Programming Algorithms Algorithms for the following primitives: Sorting: bubblesort, ...

For the first time, CISPA researcher Aleksei Stafeev presents a study that systematizes the knowledge about tools for the automated analysis ... and that randomized algorithms perform best when ...