Leibniz Universität Hannover Faculty Faculty of Electrical Engineering and Computer Science
Deutsch Contact Deutsch
Theoretical Computer Science
 
Institute of Theoretical Computer Science Teaching (German) Master’s Degree Courses
Efficient Algorithms

Efficient Algorithms

  • Course Details

    Lecturer: Prof. Dr. Arne Meier

    Frequency: Every two years (odd-numbered years) in the winter semester

    Course type: Vorlesung und Übung (2V + 1Ü + 2S, 7 ECTS)

    Examination: Oral exam

  • Course Contents

    The students are familiar with selected combinatorial problems and efficient methods for solving them. They are capable of synthesizing and analyzing such algorithms.

    Content:

    The course covers the fundamental problems of combinatorial optimization and methods for solving them.

    Outline:

    • Search trees and shortest paths
    • Flows and path systems
    • Matchings
    • Colorings
    • Linear programming
    • Union-find data structure
    • Other efficient algorithms (Streaming, Parallel, Matrix Multiplication)
  • Information about exam

    The final examination of the module is an oral exam.

    Schedule

    The exam dates are assigned via an internal institute website (see link below). Note: This does not replace registration for the exam in QIS.

    Registration

    Depending on your examination regulations, registration in QIS may be required (see link below).

    Coursework Requirement

    If your examination regulations require coursework for this module, please contact the lecturer.

Materials

Lecture recordings are available for this course.
To the recordings
Further materials can be found in Stud.IP.
To the Stud.IP

Exam registration

Online registration at the examination office
To the QIS
Schedule an appointment for the oral exam
To the THI Appointment Management

Last Change: 21.05.25 Print

Contact us
Contact