Found 6 relevant results in 2.16s where lecturer="Riko Jacob"
Game theory provides a good model for the behavior and interaction of the selfish users and programs in large-scale distributed computer systems without central control. The course discusses algorithmic aspects of game theory: Introduction to game theory, Auction-like mechanisms, Cost of a central control optimum and a selfish equilibrium, Algorithms and complexity of computing equilibria.
In many applications that work on huge data-sets, the performance bottleneck is the data-transfer between the different levels of the memory, namely processor cache, main memory, and harddisk.This phenomenon is modelled by the so-called external memory or I/O model. We study algorithm design and analysis in this model for problems in sorting and searching, computational geometry, and graphs.
In many applications that work on huge data-sets, the performance bottleneck is the data-transfer between the different levels of the memory, namely processor cache, main memory, and harddisk.This phenomenon is modelled by the so-called external memory or I/O model. We study algorithm design and analysis in this model for problems in sorting and searching, computational geometry, and graphs.
In this course, we will study the design and analysis of efficient external memory algorithms and data structures. Different paradigms for efficiently solving problems in external memory will be presented, and a number of specific algorithms from areas like sorting and searching, computational geometry, strings, and graphs will be covered.
Seminar on Computational Geometry
Seminar zur algorithmischen Geometrie
In this seminar, the students present original research papers on low-and highdimensional computational geometry, most of them very recent.Admission criterion is the former participation in the course``Algorithmische Geometrie'''.