Date(s) - 19/03/2018
11:00 am - 12:00 pm
Studio Villa Bosch
Engineering Scalable Algorithms
By Peter Sanders, Karlsruher Institut für Technologie, Fakultät für Informatik, Karlsruhe
The talk gives an overview of algorithm engineering in general and recent work of my group on algorithm engineering for large data sets and massively parallel computing. Concrete examples are basic algorithms and data structures like sorting and hashing, communication efficient algorithms, and graph algorithms. In particular algorithms for partitioning graphs and hypergraphs. Application examples are route planning, database technology, and search in genome data.
Peter Sanders received his PhD in computer science from Universität Karlsruhe 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 works at the Informatics Department of KIT in the Institute for Theoretical Computer Science.
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. He has more than 200 publications, mostly on algorithms for large data sets. This includes parallel algorithms (sorting, data structures, multi-core algorithm libraries, load balancing, communication scheduling, e.g., using network coding,…), memory hierarchies (caches, disks, storage servers,…), graph algorithms (route planning, graph partitioning…), randomized algorithms, full text indices, etc. He is very active in promoting the methodology of algorithm engineering that integrates design, analysis, implementation, and experimental evaluation of algorithms. His industrial projects include companies like BMW, Google, NEC, SAP, and several smaller companies working on route planning, logistics and search engines.
For registration please contact Benedicta Frech: email@example.com