Randomized algorithms

Basic Information

I065 (2+2+0) - 6 ECTS credits

Students will be introduced to fundamentals of probabilistic analysis and its applications in randomized algorithms. Qualify students for designing of randomized algorithms for different problems. Students will implement randomized and deterministic algorithms for given problems and make empirical evaluation of their correctness and efficiency.

You can access the course content at the following link: PDF

Teachers

 

Basic literature

  1. Mitzenmacher, E. Upfal, Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis, 2Ed, Cambridge University Press, 2017.
  2. Motwani, P. Raghavan, Randomized algorithms, Cambridge University Press, 1995.

Additional literature

  1. S. M. Ross, Introduction to Probability Models, 11th Ed, Academic Press, 2014.
  2. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.

Teaching materials

The materials are available on the internal Teams channel of the course, through which all internal communication takes place. Students are required to register on the course’s Teams channel. The channel code for joining the course can be found in the schedule.