Estonian Winter Schools in Computer Science    
Eesti arvutiteaduse talvekoolid
EWSCS 2005
EATTK 2005

10th Estonian Winter School in Computer Science (EWSCS)
X Eesti Arvutiteaduse Talvekool

Palmse, Estonia, February 27 - March 4, 2005

under the auspices of European Educational Forum

Peter Bro Miltersen

Dept. of Computer Science
University of Aarhus

Universal Methods for Derandomization


In these lectures, we consider the following related questions:

One can consider these questions both for specific randomized algorithms (using details of the analysis of the algorithms) and for arbitrary ones (i.e., without making assumption about the way the algorithms use the randomness). We shall deal with the latter kind of universal methods for derandomization. In the last decade, significant progress has been made in finding optimal universal methods. We shall give an introduction to these results.

Course materials

Background material

About the Lecturer


Modified Mar 11, 2005 14:52 by monika(at)