Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.

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 inthe course``Algorithmische 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'''.

Concepts to cope with: a) what can be accomplished in a fully automated fashion (algorithmically solvable) b) How to measure the inherent difficulty of tasks (problems) c) What is randomness and how can it be useful? d) What is nondeterminism and what role does it play in CS? e) How to represent infinite objects by finite automata and grammars?

Advanced design and analysis methods for algorithms and data structures (Random(ized) Search Trees, Network Flows, Minimum Cut, Randomized Algebraic Algorithms, Point Location, PCP Theorem).

Advanced design and analysis methods for algorithms and data structures (Random(ized) Search Trees, Network Flows, Minimum Cut, Randomized Algebraic Algorithms, Point Location, PCP Theorem).