FI:IA062 Randomized Algorithms - Course Information
IA062 Randomized Algorithms and Computations
Faculty of InformaticsSpring 2008
- Extent and Intensity
- 2/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
- Teacher(s)
- prof. RNDr. Jozef Gruska, DrSc. (lecturer), RNDr. Lukáš Boháč (deputy)
RNDr. Ivan Fialík, Ph.D. (seminar tutor) - Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc. - Timetable
- Wed 10:00–11:50 B410
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- there are 18 fields of study the course is directly associated with, display
- Course objectives
- The aim: randomized algorithms and methods are becoming one of the key tools for an effective solution of a variety of problems in informatics and its aplications practically in all theoretical and aplication areas.
- Syllabus
- Randomized algorithms and methods.
- Examples of randomized algorithms.
- Methods of game theory.
- Main types of randomized algorithms.
- Randomized complexity classes.
- Chernoff's bounds.
- Moments and deviations.
- Probabilistic methods.
- Markov chains and random walks.
- Algebraic methods.
- Aplications:
- Linear programming.
- Parallel and distributed algoritms.
- Randomization in cryptography.
- Randomized methods in theory of numbers.
- Literature
- Language of instruction
- English
- Further Comments
- The course is taught annually.
- Enrolment Statistics (Spring 2008, recent)
- Permalink: https://is.muni.cz/course/fi/spring2008/IA062