Semester | Sommersemester 2016 |
Modulnummer | INF-ALG-05 |
Veranstaltungsnummer | INF-ALG-009, INF-ALG-010 |
Studiengänge | Informatik Master, Wirtschaftsinformatik Master |
IBR Gruppe | ALG (Prof. Fekete) |
Art | Vorlesung & Übung |
Dozent | Dr. Victor Alvarez Ehemaliger Wissenschaftlicher Mitarbeiter |
Assistent | Dr. Victor Alvarez Ehemaliger Wissenschaftlicher Mitarbeiter |
LP | 5 |
SWS | 2+1+1 |
Ort & Zeit | Lecture: Wednesday, 13:15 - 14:45 hrs., PK 3.1 Tutorial: Tuesdays, 15:00 - 16:30 hrs., IZ 161, bi-weekly Small Tutorial: Tuesdays, 15:00 - 16:30 hrs., IZ 161, bi-weekly. |
Beginn | First Lecture: Wednesday, 13.04.2016 First Tutorial: Tuesday, 26.04.2016 First Small Tutorial: Tuesday, 03.05.2016 |
Voraussetzungen | Basic knowledge of analysis of Algorithms and Data Structures (AuD), and Graph Algorithms (NWA). Elementary knowledge of probability is useful but not required. |
Sprache | English |
Scheinerwerb | Homework assignments during the semester (=Studienleistung) and one exam at the end. |
Inhalt | Algorithm Engineering has recently emerged as an interesting field of research. Traditionally, an algorithm is regarded efficient whenever its running time is polynomial in its input size (polynomial-time algorithm). Furthermore, when speaking about running times of algorithms, we tend to speak in terms of O-notation — which not only ignores lower-degree terms, but also ignores the constants preceding the terms. This situations tend to produce certain degree of doubt among practitioners as they cannot be sure whether a (theoretical) algorithm is usable at all in practice. This discrepancy produces a gap between theory and practice that Algorithm Engineering tries to bridge by designing algorithms that indeed exhibit fast execution times, but for which theoretical guarantees regarding performance can be proven. That is, Algorithm Engineering lives at the amazing intersection between Theoretical and Practical Computer Science. In this course we will cover topics regarding:
|
Literatur/Links | The course will be mostly based on recent research papers. All references will be given at the appropriate time. However, the following two books are excellent references about Algorithm Engineering:
|
General Information
|
Technische Universität Braunschweig
Universitätsplatz 2
38106 Braunschweig
Postfach: 38092 Braunschweig
Telefon: +49 (0) 531 391-0