50 years Univerity of Lübeck

Institute for Theoretical Computer Science

SS 2006 – Efficient Algorithms


[ Type and Content | Lecture ]

Type and Content
Title: Efficient Algorithms
Host: Reischuk, Hinkelmann
Classification: Proseminar
Diplom-Studiengang 2. / 4. Semester
Bachelor-Studiengang 2. / 4. Semester
Conentent:

This undergraduate seminar (Proseminar) will be held in English and we will talk about:

  • efficient data structures
  • methods of algorithm design
  • graph algorithms
  • algebraic problems
Literature:
  • Cormen, Leiserson, Rivest: Introduction to Algorithms. MIT Press
  • Ottmann, Widmeyer: Algorithmen und Datenstrukturen. BI-Wissenschaftsverlag
  • Base: Computer Algorithms. Addison Wesley
Helpful links:

Lecture
Host: Reischuk, Hinkelmann
Hours: 2 SWS, 4 ECTS
Dates: Mo. 10.00h-12.00h, ITCS-Seminarraum 21, 2. OG., Geb. 64
  1. 24.04.2006 Hash Tables - Henry Schütze
  2. 08.05.2006 Red-Black Trees - Xiao Fu
  3. 15.05.2006 Union-Find Structures - Wei Cao
  4. 22.05.2006 Dynamic Programming - Markus Hüllebrand
  5. 29.05.2006 Elementary Graph Algorithms, Graph Traversal, Connected Components - Ludwig Gramberg
LaTeX Intro

The students are encouraged to use LaTeX to write their expositions. A short and pratical introduction of LaTeX can be found in our LaTeX Intro (in German): PS/PDF/ TeX The TeX-File can also be used as a template for an exposition!

TeXPoint - LaTeX for PowerPoint!

Do you want to include formulas in your slides? You don't have time to get to know all necessary LaTeX features to prepare a presentation? Then, give a try to TeXPoint - a LaTeX plugin for PowerPoint.