Main Content
  • Sebastian Wild

Algorithms Group

The Algorithms Group works on the design and analysis of algorithms and data structures, with the overall aim of making working with ever larger datasets more efficient.

Our research covers the fundamental questions of theoretical computer science that follow from this goal and are answered by mathematical proofs, such as the question of the asymptotic complexity of an algorithmic problem. We also work on the engineering of algorithms and data structures to make theoretical results accessible and useful for practical applications.

A focus area of our group is sorting, as showcased by the widely used sorting algorithm Powersort, the new sorting method in Python.