Peter Sanders (born 1967)[1] is a German computer scientist who works as a professor of computer science at the Karlsruhe Institute of Technology. His research concerns the design, analysis, and implementation of algorithms and data structures,[2] and he is particularly known for his research on suffix sorting finding shortest paths in road networks.[3]
Sanders earned his Ph.D. from Karlsruhe in 1996, and worked for seven years at the Max Planck Institute for Informatics in Saarbrücken (completing his habilitation there in 2000) before returning to Karlsruhe as a professor in 2004.[4]
Sanders was one of the winners of the Gottfried Wilhelm Leibniz Prize in 2012.[3][5]
- ^ Birthdate from German national library entry for Sanders, retrieved 2015-01-24.
- ^ Faculty profile, retrieved 2015-01-24.
- ^ a b Prof. Dr. Peter Sanders – Gottfried Wilhelm Leibniz-Preisträger 2012, Deutsche Forschungsgemeinschaft (in German), retrieved 2015-01-24.
- ^ Biography as a keynote speaker at Parallel 2014 Archived 2016-03-04 at the Wayback Machine, retrieved 2015-01-24.
- ^ Leibniz Prize 2012 for Peter Sanders!, Springer, 2012, retrieved 2015-01-24.