Richard Kralovic: Catalogue data in Spring Semester 2022 |
| Name | Dr. Richard Kralovic |
| Address | Professur Algorithmen und Didaktik ETH Zürich, CAB F 13.1 Universitätstrasse 6 8092 Zürich SWITZERLAND |
| rkralovi@inf.ethz.ch | |
| Department | Computer Science |
| Relationship | Lecturer |
| Number | Title | ECTS | Hours | Lecturers | |
|---|---|---|---|---|---|
| 252-4910-00L | Randomized Algorithms   The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar. Number of participants limited to 24. | 2 credits | 2S | H.‑J. Böckenhauer, R. Kralovic | |
| Abstract | We look into randomized approaches for dealing with computational problems. A randomized algorithm uses random decisions to guide its computation. Its quality is measured in a worst-case manner over all instances by a probability distribution over the taken random decisions. We analyze different design methods and error models. | ||||
| Learning objective | To systematically acquire an overview of the methods for designing randomized algorithms. To get deeper knowledge of the classification of randomized algorithms according to error models. To learn how to analyze the error probability of randomized algorithms.To learn about typical applications for randomized computations. | ||||
| Content | In this seminar, we discuss how randomization can help to speed up algorithms for various computational problems. In the kick-off meeting, we will give a brief overview of modeling and classifying randomized algorithms. Then, each participant will study one aspect of this topic, following a specific scientific publication, and will give a presentation about this topic. The topics will include design methods for randomized algorithms like fingerprinting, foiling an adversary, random sampling, randomized rounding as well as the classification of randomized algorithms according to their error (e.g., Las Vegas vs. Monte Carlo algorithms). The considered problems will include, among others, hashing, primality testing, communication protocols, maximum satisfiability. | ||||
| Literature | The literature will consist of textbook chapters and original research papers and will be provided during the kick-off meeting. | ||||
| Prerequisites / Notice | The participants should be familiar with the content of the lectures "Algorithmen und Datenstrukturen" (252-0026-00) and "Theoretische Informatik" (252-0057-00). The presentations will be given in the form of a block course in the second week of June 2022. The language can be mixed in German and English in the following sense: The teaching material will be in English, but it will be possible for at least half of the participants to give their presentations and hand in their written summaries in German. | ||||