263-4500-00L  Advanced Algorithms

SemesterAutumn Semester 2020
LecturersM. Ghaffari
Periodicityyearly recurring course
Language of instructionEnglish



Courses

NumberTitleHoursLecturers
263-4500-00 VAdvanced Algorithms
The lecturers will communicate the exact lesson times of ONLINE courses.
3 hrs
Wed09:00-12:00ON LI NE »
M. Ghaffari
263-4500-00 UAdvanced Algorithms
The lecturers will communicate the exact lesson times of ONLINE courses.
2 hrs
Fri10:00-12:00ON LI NE »
M. Ghaffari
263-4500-00 AAdvanced Algorithms3 hrsM. Ghaffari

Catalogue data

AbstractThis is a graduate-level course on algorithm design (and analysis). It covers a range of topics and techniques in approximation algorithms, sketching and streaming algorithms, and online algorithms.
ObjectiveThis course familiarizes the students with some of the main tools and techniques in modern subareas of algorithm design.
ContentThe lectures will cover a range of topics, tentatively including the following: graph sparsifications while preserving cuts or distances, various approximation algorithms techniques and concepts, metric embeddings and probabilistic tree embeddings, online algorithms, multiplicative weight updates, streaming algorithms, sketching algorithms, and derandomization.
Lecture notesLink
Prerequisites / NoticeThis course is designed for masters and doctoral students and it especially targets those interested in theoretical computer science, but it should also be accessible to last-year bachelor students.

Sufficient comfort with both (A) Algorithm Design & Analysis and (B) Probability & Concentrations. E.g., having passed the course Algorithms, Probability, and Computing (APC) is highly recommended, though not required formally. If you are not sure whether you're ready for this class or not, please consult the instructor.

Performance assessment

Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
ECTS credits9 credits
ExaminersM. Ghaffari
Typesession examination
Language of examinationEnglish
RepetitionThe performance assessment is offered every session. Repetition possible without re-enrolling for the course unit.
Mode of examinationwritten 180 minutes
Additional information on mode of examinationThis course has a final exam (3 hours, open book, 60% of the final
grade) plus two graded homework (20% each). The two mandatory graded homework (compulsory continuous performance assessments) will be released throughout the semester, in specific dates that will be announced. Each graded homework will have a deadline two weeks after the release. The solutions must be typeset in LaTeX (or similar).
These solutions will be graded and the grade for each GHW accounts for 20% of the final grade.
Written aidsopen book: you are permitted to consult any books, handouts, and personal notes. The use of electronic devices is not allowed.
This information can be updated until the beginning of the semester; information on the examination timetable is binding.

Learning materials

 
Main linkInformation
Only public learning materials are listed.

Groups

No information on groups available.

Restrictions

There are no additional restrictions for the registration.

Offered in

ProgrammeSectionType
CAS in Computer ScienceFocus Courses and ElectivesWInformation
Cyber Security MasterElective CoursesWInformation
Data Science MasterData ManagementWInformation
Doctoral Dep. of Information Technology and Electrical EngineeringDoctoral and Post-Doctoral CoursesWInformation
Computer Science MasterCore CoursesWInformation
Computer Science MasterElective CoursesWInformation
Computer Science MasterFocus Elective Courses Theoretical Computer ScienceWInformation
Computer Science MasterFocus Elective Courses General StudiesWInformation
Computer Science MasterMinor in Theoretical Computer ScienceWInformation
Mathematics BachelorAuswahl: Theoretical Computer ScienceWInformation
Mathematics MasterAuswahl: Theoretical Computer Science, Discrete MathematicsWInformation