Random Alborithms (Fall 2017-18, Master Inovation and Research in Informatics)

Final Grades

The course uses probabilistic techniques to dessign and analyze algorithms for problems.

Loosely we will follow Mitzenmacher-Upfal: "Probability and Computing" Cambridge UP 2005 .

Assumptions: Basic probability theory and a course on algorithm design (at the level of Dasgupta, Papadimitriou, Vazirani: Algorithms)

  • My personal sketch of lectures will appear in this page as the course progeresses.

  • Administrative trivia:

    Administrative triviaEvaluation: