Exercises for the Final Exam:
send solutions to mereghetti@dsi.unimi.it by June 1th, 2008
Further
Exercises
(not for the final exam) with some
solutions
| Randomness is a powerful phenomenon that can be harnessed to solve various problems in many areas of computer science. Randomized algorithms are often more efficient, simpler, and, surprisingly, also more reliable that their deterministic counterparts. There exists computing tasks that requires billions of years of computer work when solved by using fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities. In this course we systematically teach the most fascinating algorithm design paradigms and try to provide an insight into the nature of the success of randomized algorithms. |
|
Exercises for the Final Exam:
send solutions to mereghetti@dsi.unimi.it by June 1th, 2008
|
Textbook
J. Hromkovic
Design and Analysis of Randomized Algorithms.
Introduction to Design Paradigms.
Texts in Theoretical Computer Science, EATCS, Springer, 2005.
The text covers completely the whole course in detail.
It contains all important informal ideas as well as formal proofs,
and lectures are only subsets of the written material.
Style of the course:
Students will be asked not to write but to listen and communicate.
For more information:
mereghetti@dsi.unimi.it
Download infos in this page:
[.pdf]