// Keynote: Engineering Parallel Algorithms

Algorithms are at the heart of every nontrivial computer application. With the ubiquity of parallel processing this means that we need efficient parallel algorithms for all performance critical applications. The talk presents algorithm engineering as an approach for developing such methods: Modelling, design, analysis, implementation and experiments work together and lead to high performance applications and widely usable software libraries. Parallel sorting algorithms are used as an example throughout the talk. Further examples include parallel graph algorithms.

// Peter Sanders

received his PhD in computer science from Universität Karlsruhe, Germany in 1996. After 7 years at the Max-Planck-Institute for Informatics in Saarbrücken he returned to Karlsruhe as a full professor in 2004. He has more than 200 publications, mostly on algorithms for large data sets. This includes parallel algorithms (load balancing,...) memory hierarchies, graph algorithms (route planning, graph partitioning...), randomized algorithms, full text indices,... He is very active in promoting the methodology of algorithm engineering. For example, he currently heads a DFG priority program on AE in Germany. Peter Sanders won a number of prices, perhaps most notably the DFG Leibniz Award 2012 which amounts to 2.5 million Euros of research money.