Przemyslaw Uznanski: Katalogdaten im Frühjahrssemester 2018

NameHerr Dr. Przemyslaw Uznanski

252-3002-00LAlgorithms for Database Systems Information
Limited number of participants.
2 KP2SP. Widmayer, P. Uznanski
KurzbeschreibungQuery processing, optimization, stream-based systems, distributed and parallel databases, non-standard databases.
LernzielDevelop an understanding of selected problems of current interest in the area of algorithms for database systems.
252-4230-00LAdvanced Algorithms and Data Structures Information
Um das vorhandene Angebot optimal auszunutzen, behält sich das D-INFK vor, Belegungen von Studierenden zu löschen, die sich in mehreren Veranstaltungen dieser Kategorie eingeschrieben haben, bereits die erforderlichen Leistungen in dieser Kategorie erbracht haben oder aus anderen organisatorischen Gründen nicht auf die Belegung der Veranstaltung angewiesen sind.
2 KP2SP. Widmayer, S. Leucci, P. Uznanski
KurzbeschreibungWe will look into modern approaches of algorithms and data structures. A few breakthrough and highly influential papers from the general area of algorithms, from the past 20 years will be selected for students to study.
LernzielDevelop an understanding of modern techniques and paradigms in the design of algorithms and data structures.
InhaltTopics include (but are not exhausted by):

-graph algorithms,
-text algorithms,
-approximation algorithms,
-algebra in algorithms,
-streaming algorithms,
-conditional lower bounds,
-randomness in algorithms,
Voraussetzungen / BesonderesAlgorithms and Data Structures, or equivalent.
263-4312-00LAdvanced Data Structures Information 5 KP2V + 2UP. Uznanski
KurzbeschreibungData structures play a central role in modern computer science and are essential building blocks in obtaining efficient algorithms. The course covers major results and research directions in data structures, that (mostly) have not yet made it into standard computer science curriculum.
LernzielLearning modern models of computation. Applying new algorithmic techniques to the construction of efficient data structures. Understanding techniques used in both lower- and upper- bound proofs on said data structures.
InhaltThis course will survey important developments in data structures that have not (yet) worked their way into the standard computer science curriculum.
Though we will cover state of the art techniques, the presentation is relatively self-contained, and only assumes a basic undergraduate data structures course (e.g., knowledge of binary search trees).

The course material includes (but is not exhausted by):
- computation models and memory models
- string indexing (suffix trees, suffix arrays)
- search trees
- static tree processing (Lowest Common Ancestor queries, Level Ancestry queries)
- range queries on arrays (queries for minimal element in a given range)
- integers-only data structures: how to sort integers in linear time, faster predecessor structures (van Emde Boas trees)
- hashing
- dynamic graphs connectivity
Voraussetzungen / BesonderesThis is a highly theoretical course. You should be comfortable with:
- algorithms and data structures
- probability

Completing Algorithms, Probability, and Computing course (252-0209-00L) is a good indicator.