Randomised Algorithms and Random Graphs
Overview
| Instructor |
Prof. Dr. rer. nat. Anusch Taraz
Prof. Dr. rer. nat. Volker Turau |
| Course Format |
2
hours
lecture 2 hours exercise |
| ECTS credit points | 6.0 |
| Workload | 180 hours total |
| Performance record | Oral Exam |
| Period | Summer Semester |
| Language | German & English |
| Stud.IP |
Lecture
Exercise |
Contents
- Introduction
- Probability Basics
- Markov Chain & Random Walks
- Graph Algorithms
- Parallel Algorithms
- Online Algorithms
- Probabilistic Methods
- Evolution of G(n,p)
- Complex Networks
Reading Resources
- Randomized Algorithms. Rajeev Motwani and Prabhakar Raghavon, Cambridge University Press, 1995.
- Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Michael Mitzenmacher and Eli Upfal, Cambridge University Press, 2005.