Campus Event Calendar

Event Entry

What and Who

Algorithm Engineering for Fundamental Data Structures and Algorithms

Peter Sanders
Max-Planck-Institut für Informatik - AG 1
AG1 Advanced Mini-Course
AG 1, AG 2, AG 3, AG 4, AG 5  
MPI Audience

Date, Time and Location

Tuesday, 15 June 2004
90 Minutes
46.1 - MPII


Algorithm engineering can be viewed as an approach to algorithm

development where design, analysis, implementation, and
experimentation work together. The course motivates this approach
using very basic algorithms and data structures.

On the first glance, these problems may seem to be solved
for a long time. But interestingly, practical and theoretical
solutions are often so different that explaining or bridging
these differences is an interesting area of research.

Concrete examples in the course include sorting, hash tables,
priority queues, search trees, and suffix arrays.


Peter Sanders
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

This mini course is within the AG1 mini

course series. But neither the
"advanced" nor the "AG1" should be taken literally.

Peter Sanders, 05/17/2004 19:02
Peter Sanders, 05/17/2004 18:58 -- Created document.