CS 574: Randomized Algorithms (Fall 2018)

Randomized Algorithms

CS 574/Spring 2018
Lectures: Wednesday/Friday 12:30:00-13:45,SC 1105

Office hours: SC 3306, TBD.
But feel free to email me...

Homeworks

The lecture would be updated as the semester unfold.

Grade policy: Homeworks (7-10) would be 10% of the class grade, and the in class final would be 90%.

FINAL (aka, The grand finale)
05/07/2018: 1:30-4:30.
Room: 0216 SC.

Randomized algorithms by Raghavan and Motwani.
Probability and Computing (2ed), by Michael Mitzenmacher, Eli Upfal.
The probabilistic method, 2ed, Noga Alon and Joel Spencer.
An excellent monograph on the topic of Random Walks and Electric Networks is Random Walks and Electric Networks, by Peter G. Doyle and J. Laurie Snell. It is avliable for free from: here.

Last modified: Mon 2018-05-07 21:50:15 UTC 2018 by Sariel Har-Peled