● Home ● Random ● Nearby ● Log in ● Settings ● Donate ● About Wikipedia ● Disclaimers

Peter Sanders (computer scientist)

● Article ● Talk ● Language ● Watch ● Edit

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 pathsinroad networks.^[3]

Sanders earned his Ph.D. from Karlsruhe in 1996, and worked for seven years at the Max Planck Institute for InformaticsinSaarbrü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]

Selected publications

edit

Books

Mehlhorn, Kurt; Sanders, Peter (2008). Algorithms and Data Structures: The Basic Toolbox. Springer. ISBN 978-3-540-77977-3. MR 2444537.^[6]

Research papers

Sanders, Peter; Egner, Sebastian; Tolhuizen, Ludo (2003), "Polynomial Time Algorithms for Network Information Flow", Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '03), New York, NY, USA: ACM, pp. 286–294, CiteSeerX 10.1.1.391.4104, doi:10.1145/777412.777464, ISBN 978-1581136616, S2CID 5507219.
Jaggi, S.; Sanders, P.; Chou, P. A.; Effros, M.; Egner, S.; Jain, K.; Tolhuizen, L. M.G.M. (2005), "Polynomial Time Algorithms for Multicast Network Code Construction", IEEE Trans. Inf. Theory, 51 (6): 1973–1982, CiteSeerX 10.1.1.705.2444, doi:10.1109/TIT.2005.847712, S2CID 16817401.
Kärkkäinen, Juha; Sanders, Peter; Burkhardt, Stefan (November 2006), "Linear Work Suffix Array Construction", Journal of the ACM, 53 (6): 918–936, doi:10.1145/1217856.1217858, S2CID 12825385.
Geisberger, Robert; Sanders, Peter; Schultes, Dominik; Delling, Daniel (2008), "Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks", Experimental Algorithms, Lecture Notes in Computer Science, vol. 5038, Berlin, Heidelberg: Springer-Verlag, pp. 319–333, doi:10.1007/978-3-540-68552-4_24, ISBN 978-3-540-68548-7, S2CID 777101.

References

edit

^ 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.

^ Elrod, Hal C. (December 2011), "Review of Algorithms 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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Peter_Sanders_(computer_scientist)&oldid=1195021830" Last edited on 11 January 2024, at 23:14

Languages

●العربية ●Deutsch ●فارسی

●This page was last edited on 11 January 2024, at 23:14 (UTC). ●Content is available under CC BY-SA 4.0 unless otherwise noted. ●Privacy policy ●About Wikipedia ●Disclaimers ●Contact Wikipedia ●Code of Conduct ●Developers ●Statistics ●Cookie statement ●Terms of Use ●Desktop