Peter Sanders (computer scientist)

<h2 id="selected-publications">Selected publications</h2>
Books
<ul><li><a href="/facts/Kurt_Mehlhorn/jj3uWv49">Mehlhorn, Kurt</a>; Sanders, Peter (2008). <a href="http://people.mpi-inf.mpg.de/~mehlhorn/ftp/Toolbox/"><i>Algorithms and Data Structures: The Basic Toolbox</i></a>. Springer. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3-540-77977-3. <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=2444537">2444537</a>.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a></li></ul>
Research papers
<ul><li>Sanders, Peter; Egner, Sebastian; Tolhuizen, Ludo (2003), "Polynomial Time Algorithms for Network Information Flow", <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '03)</i>, New York, NY, USA: ACM, pp. 286–294, <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.391.4104">10.1.1.391.4104</a>, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1145%2F777412.777464">10.1145/777412.777464</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1581136616, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:5507219">5507219</a>.</li>
<li>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", <i>IEEE Trans. Inf. Theory</i>, 51 (6): 1973–1982, <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.705.2444">10.1.1.705.2444</a>, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FTIT.2005.847712">10.1109/TIT.2005.847712</a>, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:16817401">16817401</a>.</li>
<li>Kärkkäinen, Juha; Sanders, Peter; Burkhardt, Stefan (November 2006), "Linear Work Suffix Array Construction", <i><a href="/facts/Journal_of_the_ACM/qkIF9LLS">Journal of the ACM</a></i>, 53 (6): 918–936, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1145%2F1217856.1217858">10.1145/1217856.1217858</a>, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:12825385">12825385</a>.</li>
<li>Geisberger, Robert; Sanders, Peter; Schultes, Dominik; Delling, Daniel (2008), "Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks", <i>Experimental Algorithms</i>, Lecture Notes in Computer Science, vol. 5038, Berlin, Heidelberg: Springer-Verlag, pp. 319–333, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2F978-3-540-68552-4_24">10.1007/978-3-540-68552-4_24</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3-540-68548-7, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:777101">777101</a>.</li></ul>

<h2 id="external-links">External links</h2>
<ul><li><a href="https://scholar.google.com/citations?user=0xWltyAAAAAJ">Google scholar profile</a></li>
<li><a href="https://mathgenealogy.org/id.php?id=185579">Peter Sanders</a> at the <a href="/facts/Mathematics_Genealogy_Project/J7AFo1Do">Mathematics Genealogy Project</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Birthdate from German national library entry for Sanders, retrieved 2015-01-24. <a href="http://d-nb.info/gnd/136120113" target="_blank">http://d-nb.info/gnd/136120113</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Faculty profile, retrieved 2015-01-24. <a href="http://algo2.iti.kit.edu/english/sanders.php" target="_blank">http://algo2.iti.kit.edu/english/sanders.php</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Prof. Dr. Peter Sanders – Gottfried Wilhelm Leibniz-Preisträger 2012, Deutsche Forschungsgemeinschaft (in German), retrieved 2015-01-24. <a href="https://www.dfg.de/gefoerderte_projekte/wissenschaftliche_preise/leibniz-preis/2012/sanders/index.html" target="_blank">https://www.dfg.de/gefoerderte_projekte/wissenschaftliche_preise/leibniz-preis/2012/sanders/index.html</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Biography as a keynote speaker at Parallel 2014 Archived 2016-03-04 at the Wayback Machine, retrieved 2015-01-24. <a href="http://parallelcon.de/2014/konferenz_keynote2.php" target="_blank">http://parallelcon.de/2014/konferenz_keynote2.php</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>Prof. Dr. Peter Sanders – Gottfried Wilhelm Leibniz-Preisträger 2012, Deutsche Forschungsgemeinschaft (in German), retrieved 2015-01-24. <a href="https://www.dfg.de/gefoerderte_projekte/wissenschaftliche_preise/leibniz-preis/2012/sanders/index.html" target="_blank">https://www.dfg.de/gefoerderte_projekte/wissenschaftliche_preise/leibniz-preis/2012/sanders/index.html</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Leibniz Prize 2012 for Peter Sanders!, Springer, 2012, retrieved 2015-01-24. <a href="https://www.springer.com/computer?SGWID=0-146-6-1325921-0" target="_blank">https://www.springer.com/computer?SGWID=0-146-6-1325921-0</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>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 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
</ol>

Peter Sanders (computer scientist) open-in-new

Peter Sanders (computer scientist)