- survey several important computational problems for which the traditional worst-case analysis of algorithms is ill-suited
- study systematically alternatives to worst-case analysis
This course covers the design and analysis of randomized algorithms and, more generally, applications of randomness in computing. You will learn fundamental tools from probability and see many applications of randomness in computing.
R. Sharipov. (2004)cite arxiv:math/0412421Comment: The textbook, AmSTeX, 132 pages, amsppt style, prepared for double side printing on letter size paper.