LTI
LTI

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:
  • Exercises (web page):
    2 hours per week exercises accompanying the lectures

      GroupTimeRoom TutorComment
      A01Mo. 12:00 - 14:00 00.08.038SchmidWill be merged with A02 in 2018
      A02Mo. 12:00 - 14:00 00.09.038Stotz
      A03Mo. 14:00 - 16:00 02.09.023Liebl
      B04Di. 10:00 - 12:00 00.08.053SchmidWill be merged with B05 in 2018
      B05Di. 12:00 - 14:00 03.11.018Kraft
      B06Di. 14:00 - 16:00 00.08.038Somogyi
      D07Do. 10:00 - 12:00 03.11.018Liebl
      E08Fr. 12:00 - 14:00 00.13.009Stotz
      E09Fr. 14:00 - 16:00 00.08.036Kraft

  • Course Certificate:
    To successfully complete the module students must obtain at least 40% of the points on the written exam.
  • 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: Thursday, 09 Nov 2017

  • Whole document: [1-421] (std · pr4 · pr1 · lec · two)
  • Part 1. Organizational Matters [2-15] (std · pr4 · pr1 · lec · two)
    1. Contents [12-12]
    2. Literatur [13-15]
  • Part 2. Foundations [16-117] (std · pr4 · pr1 · lec · two)
    1. Goals [17-17]
    2. Modelling Issues [18-28] (std · pr4 · pr1 · lec · two)
    3. Asymptotic Notation [29-40] (std · pr4 · pr1 · lec · two)
    4. Recurrences [41-117] (std · pr4 · pr1 · lec · two)
      1. Guessing+Induction [45-48]
      2. Master Theorem [49-64] (std · pr4 · pr1 · lec · two)
      3. The Characteristic Polynomial [65-89] (std · pr4 · pr1 · lec · two)
      4. Generating Functions [90-113]
      5. Transformation of the Recurrence [114-117]
  • Part 3. Data Structures [118-421] (std · pr4 · pr1 · lec · two)
    1. Dictionary [123-325] (std · pr4 · pr1 · lec · two)
      1. Binary Search Trees [124-133] (std · pr4 · pr1 · lec · two)
      2. Red Black Trees [134-158] (std · pr4 · pr1 · lec · two)
      3. AVL-Trees [159-182] (std · pr4 · pr1 · lec · two)
      4. Splay Trees [183-207] (std · pr4 · pr1 · lec · two)
      5. Augmenting Data Structures [208-214] (std · pr4 · pr1 · lec · two)
      6. (a,b)-trees [215-227] (std · pr4 · pr1 · lec · two)
      7. Skip Lists [228-242] (std · pr4 · pr1 · lec · two)
      8. Hashing [243-325] (std · pr4 · pr1 · lec · two)
    2. Priority Queues [326-382] (std · pr4 · pr1 · lec · two)
      1. Binary Heaps [333-342] (std · pr4 · pr1 · lec · two)
      2. Binomial Heaps [343-362] (std · pr4 · pr1 · lec · two)
      3. Fibonacci Heaps [363-382] (std · pr4 · pr1 · lec · two)
    3. Union Find [383-411] (std · pr4 · pr1 · lec · two)
    4. van Emde Boas Trees [412-421] (std · pr4 · pr1 · lec · two)

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

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

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 Theoretische Informatik
Prof. Dr. Susanne Albers

Boltzmannstr. 3
85748 Garching bei München

Tel +89.289.17706
Fax +89.289.17707

E-Mail
News