חישוב אקראי

In this course, we will learn about randomized algorithms and probabilistic techniques. The probabilistic techniques will include Chebychev's inequality, Chernoff's inequality, Martingales, Markov Chains, Lovasz Local Lemma, and the probabilistic method. We will apply these techniques in analyzing random algorithms such as balls into bins, sorting algorithms, hashing, s-t connectivity.