Matya Katz ( email@example.com )
Office hours: Monday 12:00-14:00, Alon building (37), room 212, Tel: (08) 6461628
Tuesday 14-16 ( 34/116 )
Often a randomized algorithm is the simplest and fastest algorithm available. This course deals with the design and analysis of randomized algorithms. We will present basic tools from probability theory and probabilistic analysis that are used in the design and analysis of randomized algorithms, together with a large and diverse collection of applications, illustrating these tools.
M. de Berg, O. Cheong, M. van Kreveld, M. Overmars, Springer-Verlag, 2008, ISBN: 978-3-540-77973-5
N. Alon and J.H. Spencer, Wiley, 2008
This is a 1-credit course.
Students are required to attend all lectures.
Each student will give a lecture. In addition several homework assignments and short quizzes are expected.
Last update October 4, 2009.