course: Sampling, Counting, Mixing and Balancing

speaker: Eli Upfal (Brown University)

abstract: We will cover some recent developments in the applications of probabilistic techniques to the design and analysis of algorithms. In particular we will discuss methods for approximate counting of combinatorial structures using rapidly mixing Markov chains, and combinatorial balancing techniques based on the power of multiple choice paradigm.

Reference: M.Mitzenmacher - E.Upfal, Probability and Computing. Cambridge U Press

timetable:
Mon 4 Feb, 17:15 - 19:00, Aula Dini
Tue 5 Feb, 15:00 - 15:45, Aula Dini
Tue 5 Feb, 16:15 - 17:00, Aula Dini
Wed 6 Feb, 10:00 - 10:45, Aula Dini
Wed 6 Feb, 11:00 - 11:45, Aula Dini
Thu 7 Feb, 15:00 - 15:45, Aula Dini
Thu 7 Feb, 16:15 - 17:00, Aula Dini
Fri 8 Feb, 11:00 - 11:45, Aula Dini
<< Go back