Peter Sanders (computer scientist)
{{short description|German computer scientist}}
Peter Sanders (born 1967)Birthdate from [http://d-nb.info/gnd/136120113 German national library entry for Sanders], retrieved 2015-01-24. 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,[http://algo2.iti.kit.edu/english/sanders.php Faculty profile], retrieved 2015-01-24. and he is particularly known for his research on suffix sorting finding shortest paths in road networks.
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.[http://parallelcon.de/2014/konferenz_keynote2.php Biography as a keynote speaker at Parallel 2014] {{Webarchive|url=https://web.archive.org/web/20160304044151/http://parallelcon.de/2014/konferenz_keynote2.php |date=2016-03-04 }}, retrieved 2015-01-24.
Sanders was one of the winners of the Gottfried Wilhelm Leibniz Prize in 2012.[https://www.dfg.de/gefoerderte_projekte/wissenschaftliche_preise/leibniz-preis/2012/sanders/index.html Prof. Dr. Peter Sanders – Gottfried Wilhelm Leibniz-Preisträger 2012], Deutsche Forschungsgemeinschaft (in German), retrieved 2015-01-24.[https://www.springer.com/computer?SGWID=0-146-6-1325921-0 Leibniz Prize 2012 for Peter Sanders!], Springer, 2012, retrieved 2015-01-24.
Selected publications
;Books
- {{cite book |title=Algorithms and Data Structures: The Basic Toolbox |first1=Kurt |last1=Mehlhorn |authorlink1=Kurt Mehlhorn |first2=Peter |last2=Sanders |publisher=Springer |year=2008 |isbn=978-3-540-77977-3 |mr=2444537 |url=http://people.mpi-inf.mpg.de/~mehlhorn/ftp/Toolbox/}}{{citation|title=Review of Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter Sanders|first=Hal C.|last=Elrod|journal=SIGACT News|volume=42|issue=4|date=December 2011|pages=26–29|doi=10.1145/2078162.2078168|s2cid=26805175}}
;Research papers
- {{citation
| last1 = Sanders | first1 = Peter
| last2 = Egner | first2 = Sebastian
| last3 = Tolhuizen | first3 = Ludo
| contribution = Polynomial Time Algorithms for Network Information Flow
| doi = 10.1145/777412.777464
| location = New York, NY, USA
| pages = 286–294
| publisher = ACM
| title = Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '03)
| year = 2003| isbn = 978-1581136616
| citeseerx = 10.1.1.391.4104
| s2cid = 5507219
}}.
- {{citation
| last1 = Jaggi | first1 = S.
| last2 = Sanders | first2 = P.
| last3 = Chou | first3 = P. A.
| last4 = Effros | first4 = M.
| last5 = Egner | first5 = S.
| last6 = Jain | first6 = K.
| last7 = Tolhuizen | first7 = L. M.G.M.
| doi = 10.1109/TIT.2005.847712
| issue = 6
| journal = IEEE Trans. Inf. Theory
| pages = 1973–1982
| title = Polynomial Time Algorithms for Multicast Network Code Construction
| volume = 51
| year = 2005| s2cid = 16817401
| citeseerx = 10.1.1.705.2444
}}.
- {{citation
| last1 = Kärkkäinen | first1 = Juha
| last2 = Sanders | first2 = Peter
| last3 = Burkhardt | first3 = Stefan
| date = November 2006
| doi = 10.1145/1217856.1217858
| issue = 6
| journal = Journal of the ACM
| pages = 918–936
| title = Linear Work Suffix Array Construction
| volume = 53| s2cid = 12825385
}}.
- {{citation
| last1 = Geisberger | first1 = Robert
| last2 = Sanders | first2 = Peter
| last3 = Schultes | first3 = Dominik
| last4 = Delling | first4 = Daniel
| title = Experimental Algorithms
| contribution = Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
| doi = 10.1007/978-3-540-68552-4_24
| location = Berlin, Heidelberg
| pages = 319–333
| publisher = Springer-Verlag
| series = Lecture Notes in Computer Science
| volume = 5038
| year = 2008| isbn = 978-3-540-68548-7
| s2cid = 777101
}}.
References
{{reflist}}
External links
- [https://scholar.google.com/citations?user=0xWltyAAAAAJ Google scholar profile]
- {{mathgenealogy|id=185579}}
{{Authority control}}
{{DEFAULTSORT:Sanders, Peter}}
Category:German computer scientists
Category:Academic staff of the Karlsruhe Institute of Technology