Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Peter Sanders (computer scientist)

From Wikipedia, the free encyclopedia
German computer scientist

Peter Sanders (born 1967)[1] is a German computer scientist who works as a professor of computer science at theKarlsruhe Institute of Technology. His research concerns the design, analysis, and implementation ofalgorithms anddata structures,[2] and he is particularly known for his research onsuffix sorting findingshortest paths inroad networks.[3]

Sanders earned his Ph.D. from Karlsruhe in 1996,and worked for seven years at theMax Planck Institute for Informatics inSaarbrücken (completing hishabilitation there in 2000) before returning to Karlsruhe as a professor in 2004.[4]

Sanders was one of the winners of theGottfried Wilhelm Leibniz Prize in 2012.[3][5]

Selected publications

[edit]
Books
Research papers

References

[edit]
  1. ^Birthdate fromGerman national library entry for Sanders, retrieved 2015-01-24.
  2. ^Faculty profile, retrieved 2015-01-24.
  3. ^abProf. Dr. Peter Sanders – Gottfried Wilhelm Leibniz-Preisträger 2012,Deutsche Forschungsgemeinschaft (in German), retrieved 2015-01-24.
  4. ^Biography as a keynote speaker at Parallel 2014Archived 2016-03-04 at theWayback Machine, retrieved 2015-01-24.
  5. ^Leibniz Prize 2012 for Peter Sanders!, Springer, 2012, retrieved 2015-01-24.
  6. ^Elrod, Hal C. (December 2011), "Review ofAlgorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter Sanders",SIGACT News,42 (4):26–29,doi:10.1145/2078162.2078168,S2CID 26805175

External links

[edit]
International
National
Academics
People
Other
Retrieved from "https://en.wikipedia.org/w/index.php?title=Peter_Sanders_(computer_scientist)&oldid=1195021830"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp