Algorithm Engineering -- An Attempt at a Definition with Some Subjective Examples

The talk describes algorithm engineering (AE) as a methodology for algorithmic research where design, analysis, implementation and experimental evaluation of form a feedback cycle driving the development of efficient algorithm. Additional important components of the methodology include realistic models, algorithm libraries, and collections of realistic benchmark instances. Examples are given from the work of my group including route planning, graph partitioning, stringology, data bases, and sorting, with some emphasis on a recent cooperation with SAP on many-core algorithms for in-memory column-based data bases.