Peter Sanders

Prof. Dr. rer. nat. Peter Sanders

  • Forschungsbereich Algorithmik II
    Institut für Theoretische Informatik
    Karlsruher Institut für Technologie (KIT)

    Geb. 50.34
    Am Fasanengarten 5
    D-76131 Karlsruhe

Research Interests

Peter Sanders' research is focused on algorithm theory and algorithm engineering, i.e. the design, the implementation and the analysis of efficient algorithms. In this case, analysis can be both, theoretical and experimental.
Some important research topics are:

  • Parallel processing and communication in networks
  • Solving problems with "irregular" structure
  • Randomized Algorithms
  • Memory hierarchies (disks, caches)
  • Realistic models for problems and machines
  • Routing in large networks

Scientific career

  • 10/1988–08/1993: Study of Informatics at University of Karlsruhe with scholarship of the "Studienstiftung des Deutschen Volkes"; Final Grade 1.1.
  • 08/1991–05/1992: Scholarship of the Fulbright Commission; M.Sc. in Computer Science at North Carolina State University Raleigh; GPA 4.0/4.0.
  • 09/1993–11/1997: Doctoral studies; Dr. rer. nat. summa cum laude at the Department of Informatics at the University of Karlsruhe.
  • 10/1993–07/1997: Research Associate at the Informatics Chair for Engineers and Scientists in Karlsruhe (Prof. R. Vollmar).
  • 10/1997–09/2004: Research Associate at MPI Informatik Saarbrücken (Prof. Mehlhorn).
  • 12/2000 Postdoctural lecture qualification (Habilitation) at Universität des Saarlandes.
  • 11/2001–09/2004: C3 professorship at Max Planck Institute for Informatics.
  • 10/2004–now: C4 professorship at the Department of Informatics at the University of Karlsruhe.