Goal and Contents

The goal of the lecture is to give a comprehensive introduction to the area of randomized algorithms. The focus will be on the many nice ideas with the purpose to transfer the richness of this area. However, we will also deal a substantial part of the time with the analysis of these algorithms. In the context of randomized algorithms this is often even harder than for conventional deterministic ones. A crucial problem is often the question how to handle dependencies. The book however mainly presents polished problems for which the analysis is not always easy but in any case established. The considered problems are diverse, covering all allgorithmic domains. Just to mention a few: numerical algorithms, graph algorithms, geometry, number theory.

This page was created by Jop Sibeyn.
Last update Monday, 02 February 04 - 17:49.
For any comments: send an email.