Scalable Algorithms (ITI)

Thomas Bläsius

Head of the Scalable Algorithms Group

Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics

office room 309, Computer Science building 50.34
office hours by appointment


My research is centered around the question of why algorithms often perform better in practice than the theoretical run time bounds predict. I attempt to shrink this theory-practice gap by taking properties regularly observed in real-world instances into account rather than analyzing the worst case. In this context, my research intersects with multiple other areas in the field of algorithmics, including the following:

  • graph algorithms
  • computational geometry
  • probabilistic methods (e.g., average case analysis)
  • propositional satisfiability
  • algorithm engineering
  • network science