Efficient Algorithms and Data Structures I

General Info

Lecturer: Prof. Dr. Harald Räcke
Module: IN2003, TUMonline
Area:
4+2 lectures per week in area III (Theoretical Computer Science)
core course, topic algorithms
Time and Place:
- Monday, 10:15–11:45, 5620.01.102 (102, Interims Hörsaal 2)
- Friday, 10:15–11:45, 5620.01.102 (102, Interims Hörsaal 2)
Audience:
graduate students of computer science
students with computer science as minor
Prerequisites:
1st and 2nd year courses
Recommended for:
Fundamental knowledge in topic Algorithms
Related and Advanced Lectures:
Efficient Algorithms and Data Structures II

help Slides: Monday, 23 Jan 2023

Whole document: [1-662] (std · pr4 · pr1 · lec · two)
Part 1. Organizational Matters [2-11] (std · pr4 · pr1 · lec · two)
1. Contents [8-8]
2. Literatur [9-11]
Part 2. Foundations [12-123] (std · pr4 · pr1 · lec · two)
1. Goals [13-13]
2. Modelling Issues [14-24] (std · pr4 · pr1 · lec · two)
3. Asymptotic Notation [25-45] (std · pr4 · pr1 · lec · two)
4. Recurrences [46-123] (std · pr4 · pr1 · lec · two)
  1. Guessing+Induction [50-54]
  2. Master Theorem [55-70] (std · pr4 · pr1 · lec · two)
  3. The Characteristic Polynomial [71-95] (std · pr4 · pr1 · lec · two)
  4. Generating Functions [96-119]
  5. Transformation of the Recurrence [120-123]
Part 3. Data Structures [124-453] (std · pr4 · pr1 · lec · two)
1. Dictionary [129-331] (std · pr4 · pr1 · lec · two)
  1. Binary Search Trees [130-139] (std · pr4 · pr1 · lec · two)
  2. Red Black Trees [140-164] (std · pr4 · pr1 · lec · two)
  3. Splay Trees [165-189] (std · pr4 · pr1 · lec · two)
  4. Augmenting Data Structures [190-196] (std · pr4 · pr1 · lec · two)
  5. Skip Lists [197-211] (std · pr4 · pr1 · lec · two)
  6. van Emde Boas Trees [212-248] (std · pr4 · pr1 · lec · two)
  7. Hashing [249-331] (std · pr4 · pr1 · lec · two)
2. Priority Queues [332-387] (std · pr4 · pr1 · lec · two)
  1. Binary Heaps [339-347] (std · pr4 · pr1 · lec · two)
  2. Binomial Heaps [348-367] (std · pr4 · pr1 · lec · two)
  3. Fibonacci Heaps [368-387] (std · pr4 · pr1 · lec · two)
3. Union Find [388-416] (std · pr4 · pr1 · lec · two)
4. van Emde Boas Trees [417-453] (std · pr4 · pr1 · lec · two)
Part 4. Flows and Cuts [454-600] (std · pr4 · pr1 · lec · two)
1. Introduction [456-465] (std · pr4 · pr1 · lec · two)
2. Augmenting Path Algorithms [466-494] (std · pr4 · pr1 · lec · two)
  1. The Generic Augmenting Path Algorithm [466-477] (std · pr4 · pr1 · lec · two)
  2. Shortest Augmenting Paths [478-488] (std · pr4 · pr1 · lec · two)
  3. Capacity Scaling [489-494] (std · pr4 · pr1 · lec · two)
3. Flow Applications [495-511] (std · pr4 · pr1 · lec · two)
  1. Matching [495-501]
  2. Baseball Elimination [502-507]
  3. Project Selection [508-511]
4. Push Relabel Algorithms [512-546] (std · pr4 · pr1 · lec · two)
  1. Generic Push Relabel [512-532] (std · pr4 · pr1 · lec · two)
  2. Relabel to Front [533-540] (std · pr4 · pr1 · lec · two)
  3. Highest Label [541-546] (std · pr4 · pr1 · lec · two)
5. Mincost Flow [547-568] (std · pr4 · pr1 · lec · two)
6. Gomory Hu Trees [569-584] (std · pr4 · pr1 · lec · two)
7. Global Mincut [585-600] (std · pr4 · pr1 · lec · two)
Part 5. Matchings [601-661] (std · pr4 · pr1 · lec · two)
1. Definition [602-602]
2. Bipartite Matching via Flows [603-603]
3. Augmenting Paths for Matchings [604-613]
4. Weighted Bipartite Matching [614-627] (std · pr4 · pr1 · lec · two)
5. Maximum Matching in General Graphs [628-649] (std · pr4 · pr1 · lec · two)
6. The Hopcroft-Karp Algorithm [650-661] (std · pr4 · pr1 · lec · two)

Annotierte Folien

Error: not available

July 2022: Jens Quedenfeld completed his doctoral degree.

June 2022: Maximilian Janke completed his doctoral degree.

March 2022: Alexander Eckl completed his doctoral degree.

June 2021: Leon Ladwig completed his doctoral degree.

February 2020: The Program Committee of SWAT 2020 is chaired by Susanne Albers.

February 2020: Susanne Albers is invited speaker at the ACM India Annual Event.

ESA/ALGO 2019 will be organized by Susanne Albers and her group.

May 2019: Susanne Albers is invited speaker at the symposium 50 Years Informatics

July 2019: Susanne Albers is invited speaker at SIROCCO 2019, Italy.

December 2017: Susanne Albers will give keynote address at the Graduation Day, Department of Computer Science at RWTH Aachen University.

April 2017: New Research Training Center AdONE, funded by the German Research Foundation.

Susanne Albers receives ERC Advanced Grant. Press release of the Bavarian State Ministry of the Sciences, Research and the Arts.

August 2016: Susanne Albers is keynote speaker at Euro-Par 2016, Grenoble.

Susanne Albers, Nicole Megow and Andreas S. Schulz will organize MAPSP 2017.

Juni 2016: Susanne Albers gives an invited lecture at the Academy of Sciences and Literature, Mainz.

September 2015: Susanne Albers is invited speaker at MPI-INF – 25th Anniversary. The program features several Turing Award winners, Leibniz Prize winners, Humboldt Prize winners and ERC Grant winners.

June 2015: Susanne Albers is keynote speaker at the 31st International Symposium on Computational Geometry (SOCG15), Eindhoven.

June 2015: Susanne Albers is invited speaker of the tutorial on Network Creation Games: How Does the Internet Form? organized by Erik D. Demaine (MIT) and MohammadTaghi Hajiaghayi (University of Maryland). 16th Conference on Electronic Commerce (EC15), Portland, Oregon.

Lehrstuhl für Algorithmen und Komplexität

Prof. Dr. Susanne Albers

Boltzmannstr. 3
85748 Garching bei München

Tel +89.289.17706
Fax +89.289.17707