25,161
edits
Changes
Created page with "'''Home * People * Peter Sanders''' FILE:sm_sanders.jpg|border|right|thumb|link=http://algo2.iti.kit.edu/english/sanders.php| Peter Sanders <ref>[http://..."
'''[[Main Page|Home]] * [[People]] * Peter Sanders'''
[[FILE:sm_sanders.jpg|border|right|thumb|link=http://algo2.iti.kit.edu/english/sanders.php| Peter Sanders <ref>[http://algo2.iti.kit.edu/english/sanders.php KIT – ITI Algorithmics II – Members - Peter Sanders]</ref> ]]
'''Peter Sanders''',<br/>
a German computer scientist and professor at [https://en.wikipedia.org/wiki/Karlsruhe_Institute_of_Technology Karlsruhe Institute of Technology] with former appointment at [https://en.wikipedia.org/wiki/Max_Planck_Institute_for_Computer_Science Max Planck Institute for Computer Science].
His research interests covers [[Algorithms|algorithm]] theory, [https://en.wikipedia.org/wiki/Algorithm_engineering algorithm engineering], parallel processing and communication in networks and solving problems with "irregular" structures, like [[Parallel Search|parallel game tree search]].
=Selected Publications=
<ref>[http://algo2.iti.kit.edu/sanders/papers/index.html Peter Sanders - Publications]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/s/Sanders_0001:Peter dblp: Peter Sanders]</ref>
==1994 ...==
* [[Peter Sanders]] ('''1994'''). ''[https://publikationen.bibliothek.kit.edu/1000087994 Suchalgorithmen auf SIMD-Rechnern – Weitere Ergebnisse zu Polyautomaten]''. Diploma thesis, [https://en.wikipedia.org/wiki/Karlsruhe_Institute_of_Technology University of Karlsruhe] (German)
* [[Peter Sanders]] ('''1994'''). ''[https://publikationen.bibliothek.kit.edu/329894 Massively Parallel Search for Transition-Tables of Polyautomata]''. [https://dblp.uni-trier.de/db/conf/parcella/parcella1994.html Parcella 1994], [http://algo2.iti.kit.edu/sanders/papers/parcella94.pdf pdf]
* [[Peter Sanders]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007%2F3-540-60321-2_30 Fast priority queues for parallel branch-and-bound]''. [https://dblp.uni-trier.de/db/conf/irregular/irregular95.html IRREGULAR 1995] <ref>[[Richard Karp]], [[Yanjun Zhang]] ('''1988'''). ''[https://dl.acm.org/doi/10.1145/62212.62240 A randomized parallel branch-and-bound procedure]''. [https://dblp.uni-trier.de/db/conf/stoc/stoc88.html STOC '88]</ref>
* [[Peter Sanders]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007/3-540-60321-2_27 Better Algorithms for Parallel Backtracking]''. [https://dblp.uni-trier.de/db/conf/irregular/irregular95.html IRREGULAR 1995]
* [[Holger Hopp]], [[Peter Sanders]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007/3-540-60321-2_28 Parallel Game Tree Search on SIMD Machines]''. [https://dblp.uni-trier.de/db/conf/irregular/irregular95.html IRREGULAR 1995], [http://algo2.iti.kit.edu/sanders/papers/gamet.pdf pdf]
* [[Peter Sanders]] ('''1997'''). ''[https://publikationen.bibliothek.kit.edu/997 Lastverteilungsalgorithmen für parallele Tiefensuche]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Karlsruhe_Institute_of_Technology University of Karlsruhe], advisor [[Mathematician#RVollmar|Roland Vollmar]] (German)
* [[Peter Sanders]] ('''1998'''). ''[https://www.semanticscholar.org/paper/Tree-Shaped-Computations-as-a-Model-for-Parallel-Sanders/7c87f64bd5b61ea27b2625a32a5e696f6faf814e Tree Shaped Computations as a Model for Parallel Applications]''. [https://en.wikipedia.org/wiki/Max_Planck_Institute_for_Informatics Max Planck Institute for Computer Science], [http://algo2.iti.kit.edu/sanders/papers/alv.pdf pdf]
==2000 ...==
* [[Peter Sanders]] ('''2000'''). ''[https://dl.acm.org/doi/10.1145/351827.384249 Fast Priority Queues for Cached Memory]''. [[ACM#JEA|ACM Journal of Experimental Algorithmics]], Vol. 5
* [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2003'''). ''Scanning Multiple Sequences Via Cache Memory''. [https://en.wikipedia.org/wiki/Algorithmica Algorithmica], Vol. 35, No. 1
* [[Mathematician#DFotakis|Dimitris Fotakis]], [[Mathematician#RPagh|Rasmus Pagh]], [[Peter Sanders]], [[Mathematician#PGSpirakis|Paul Spirakis]] ('''2005'''). ''[https://link.springer.com/article/10.1007/s00224-004-1195-x Space Efficient Hash Tables with Worst Case Constant Access Time]''. [https://en.wikipedia.org/wiki/Theory_of_Computing_Systems Theory of Computing Systems], Vol. 38, No. 2
* [[Mathematician#SJaggi|Sidharth Jaggi]], [[Peter Sanders]], [[Mathematician#PAChou|Philip A. Chou]], [[Mathematician#MEffros|Michelle Effros]], [[Mathematician#SEgner|Sebastian Egner]], [[Mathematician#KJain|Kamal Jain]], [[Mathematician#LTolhuizen|Ludo Tolhuizen]] ('''2005'''). ''[https://authors.library.caltech.edu/1814/ Polynomial time algorithms for multicast network code construction]''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 51, No. 6, [https://authors.library.caltech.edu/1814/1/JAGieeetit05.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Max-flow_min-cut_theorem Max-flow min-cut theorem from Wikipedia]</ref>
* [[Peter Sanders]], [https://dblp.uni-trier.de/pers/hd/t/Tr=auml=ff:Jesper_Larsson Jesper Larsson Träff] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/11846802_15 Parallel Prefix (Scan) Algorithms for MPI]''. [https://dblp.uni-trier.de/db/conf/pvm/pvm2006.html EuroPVM/MPI 2006], [http://algo2.iti.uni-karlsruhe.de/sanders/papers/scan.pdf pdf]
* [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2008'''). ''[http://www.mpi-inf.mpg.de/~mehlhorn/Toolbox.html Algorithms and Data Structures: The Basic Toolbox]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [https://dblp.uni-trier.de/pers/hd/p/Putze:Felix Felix Putze], [[Peter Sanders]], [https://dblp.uni-trier.de/pers/hd/s/Singler:Johannes Johannes Singler] ('''2009'''). ''Cache-, Hash- and Space-Efficient Bloom Filters''. [[ACM#JEA|ACM Journal of Experimental Algorithmics]], Vol. 14, [http://algo2.iti.kit.edu/documents/cacheefficientbloomfilters-jea.pdf pdf]
==2010 ...==
* [[Peter Sanders]] ('''2011'''). ''[https://link.springer.com/referenceworkentry/10.1007/978-0-387-09766-4_89 Algorithm Engineering]''. [https://link.springer.com/referencework/10.1007/978-0-387-09766-4 Encyclopedia of Parallel Computing 2011]
* [https://dblp.uni-trier.de/pers/hd/b/Bingmann:Timo Timo Bingmann], [[Peter Sanders]] ('''2013'''). ''[https://publikationen.bibliothek.kit.edu/1000039066 Parallel String Sample Sort]''. [https://arxiv.org/abs/1305.1157 arXiv:1305.1157]
* [https://dblp.uni-trier.de/pers/hd/r/Rihani:Hamza Hamza Rihani], [[Peter Sanders]], [https://dblp.uni-trier.de/pers/hd/d/Dementiev:Roman Roman Dementiev] ('''2014'''). ''MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues''. [https://arxiv.org/abs/1411.1209 arXiv:1411.1209]
* [https://dblp.uni-trier.de/pers/hd/m/Maier:Tobias Tobias Maier], [[Peter Sanders]], [https://dblp.uni-trier.de/pers/hd/d/Dementiev:Roman Roman Dementiev] ('''2016'''). ''Concurrent Hash Tables: Fast and General?(!)''. [https://arxiv.org/abs/1601.04017 arXiv:1601.04017]
* [https://dblp.uni-trier.de/pers/hd/m/Maier:Tobias Tobias Maier], [[Peter Sanders]] ('''2017'''). ''Dynamic Space Efficient Hashing''. [https://arxiv.org/abs/1705.00997 arXiv:1705.00997]
* [[Peter Sanders]] ('''2018'''). ''Hashing with Linear Probing and Referential Integrity''. [https://arxiv.org/abs/1808.04602 arXiv:1808.04602]
=External Links=
* [https://en.wikipedia.org/wiki/Peter_Sanders_(computer_scientist) Peter Sanders from Wikipedia]
* [http://algo2.iti.kit.edu/english/sanders.php KIT – ITI Algorithmics II – Members - Peter Sanders]
* [https://www.genealogy.math.ndsu.nodak.edu/id.php?id=185579 Peter Sanders - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:sm_sanders.jpg|border|right|thumb|link=http://algo2.iti.kit.edu/english/sanders.php| Peter Sanders <ref>[http://algo2.iti.kit.edu/english/sanders.php KIT – ITI Algorithmics II – Members - Peter Sanders]</ref> ]]
'''Peter Sanders''',<br/>
a German computer scientist and professor at [https://en.wikipedia.org/wiki/Karlsruhe_Institute_of_Technology Karlsruhe Institute of Technology] with former appointment at [https://en.wikipedia.org/wiki/Max_Planck_Institute_for_Computer_Science Max Planck Institute for Computer Science].
His research interests covers [[Algorithms|algorithm]] theory, [https://en.wikipedia.org/wiki/Algorithm_engineering algorithm engineering], parallel processing and communication in networks and solving problems with "irregular" structures, like [[Parallel Search|parallel game tree search]].
=Selected Publications=
<ref>[http://algo2.iti.kit.edu/sanders/papers/index.html Peter Sanders - Publications]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/s/Sanders_0001:Peter dblp: Peter Sanders]</ref>
==1994 ...==
* [[Peter Sanders]] ('''1994'''). ''[https://publikationen.bibliothek.kit.edu/1000087994 Suchalgorithmen auf SIMD-Rechnern – Weitere Ergebnisse zu Polyautomaten]''. Diploma thesis, [https://en.wikipedia.org/wiki/Karlsruhe_Institute_of_Technology University of Karlsruhe] (German)
* [[Peter Sanders]] ('''1994'''). ''[https://publikationen.bibliothek.kit.edu/329894 Massively Parallel Search for Transition-Tables of Polyautomata]''. [https://dblp.uni-trier.de/db/conf/parcella/parcella1994.html Parcella 1994], [http://algo2.iti.kit.edu/sanders/papers/parcella94.pdf pdf]
* [[Peter Sanders]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007%2F3-540-60321-2_30 Fast priority queues for parallel branch-and-bound]''. [https://dblp.uni-trier.de/db/conf/irregular/irregular95.html IRREGULAR 1995] <ref>[[Richard Karp]], [[Yanjun Zhang]] ('''1988'''). ''[https://dl.acm.org/doi/10.1145/62212.62240 A randomized parallel branch-and-bound procedure]''. [https://dblp.uni-trier.de/db/conf/stoc/stoc88.html STOC '88]</ref>
* [[Peter Sanders]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007/3-540-60321-2_27 Better Algorithms for Parallel Backtracking]''. [https://dblp.uni-trier.de/db/conf/irregular/irregular95.html IRREGULAR 1995]
* [[Holger Hopp]], [[Peter Sanders]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007/3-540-60321-2_28 Parallel Game Tree Search on SIMD Machines]''. [https://dblp.uni-trier.de/db/conf/irregular/irregular95.html IRREGULAR 1995], [http://algo2.iti.kit.edu/sanders/papers/gamet.pdf pdf]
* [[Peter Sanders]] ('''1997'''). ''[https://publikationen.bibliothek.kit.edu/997 Lastverteilungsalgorithmen für parallele Tiefensuche]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Karlsruhe_Institute_of_Technology University of Karlsruhe], advisor [[Mathematician#RVollmar|Roland Vollmar]] (German)
* [[Peter Sanders]] ('''1998'''). ''[https://www.semanticscholar.org/paper/Tree-Shaped-Computations-as-a-Model-for-Parallel-Sanders/7c87f64bd5b61ea27b2625a32a5e696f6faf814e Tree Shaped Computations as a Model for Parallel Applications]''. [https://en.wikipedia.org/wiki/Max_Planck_Institute_for_Informatics Max Planck Institute for Computer Science], [http://algo2.iti.kit.edu/sanders/papers/alv.pdf pdf]
==2000 ...==
* [[Peter Sanders]] ('''2000'''). ''[https://dl.acm.org/doi/10.1145/351827.384249 Fast Priority Queues for Cached Memory]''. [[ACM#JEA|ACM Journal of Experimental Algorithmics]], Vol. 5
* [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2003'''). ''Scanning Multiple Sequences Via Cache Memory''. [https://en.wikipedia.org/wiki/Algorithmica Algorithmica], Vol. 35, No. 1
* [[Mathematician#DFotakis|Dimitris Fotakis]], [[Mathematician#RPagh|Rasmus Pagh]], [[Peter Sanders]], [[Mathematician#PGSpirakis|Paul Spirakis]] ('''2005'''). ''[https://link.springer.com/article/10.1007/s00224-004-1195-x Space Efficient Hash Tables with Worst Case Constant Access Time]''. [https://en.wikipedia.org/wiki/Theory_of_Computing_Systems Theory of Computing Systems], Vol. 38, No. 2
* [[Mathematician#SJaggi|Sidharth Jaggi]], [[Peter Sanders]], [[Mathematician#PAChou|Philip A. Chou]], [[Mathematician#MEffros|Michelle Effros]], [[Mathematician#SEgner|Sebastian Egner]], [[Mathematician#KJain|Kamal Jain]], [[Mathematician#LTolhuizen|Ludo Tolhuizen]] ('''2005'''). ''[https://authors.library.caltech.edu/1814/ Polynomial time algorithms for multicast network code construction]''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 51, No. 6, [https://authors.library.caltech.edu/1814/1/JAGieeetit05.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Max-flow_min-cut_theorem Max-flow min-cut theorem from Wikipedia]</ref>
* [[Peter Sanders]], [https://dblp.uni-trier.de/pers/hd/t/Tr=auml=ff:Jesper_Larsson Jesper Larsson Träff] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/11846802_15 Parallel Prefix (Scan) Algorithms for MPI]''. [https://dblp.uni-trier.de/db/conf/pvm/pvm2006.html EuroPVM/MPI 2006], [http://algo2.iti.uni-karlsruhe.de/sanders/papers/scan.pdf pdf]
* [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2008'''). ''[http://www.mpi-inf.mpg.de/~mehlhorn/Toolbox.html Algorithms and Data Structures: The Basic Toolbox]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [https://dblp.uni-trier.de/pers/hd/p/Putze:Felix Felix Putze], [[Peter Sanders]], [https://dblp.uni-trier.de/pers/hd/s/Singler:Johannes Johannes Singler] ('''2009'''). ''Cache-, Hash- and Space-Efficient Bloom Filters''. [[ACM#JEA|ACM Journal of Experimental Algorithmics]], Vol. 14, [http://algo2.iti.kit.edu/documents/cacheefficientbloomfilters-jea.pdf pdf]
==2010 ...==
* [[Peter Sanders]] ('''2011'''). ''[https://link.springer.com/referenceworkentry/10.1007/978-0-387-09766-4_89 Algorithm Engineering]''. [https://link.springer.com/referencework/10.1007/978-0-387-09766-4 Encyclopedia of Parallel Computing 2011]
* [https://dblp.uni-trier.de/pers/hd/b/Bingmann:Timo Timo Bingmann], [[Peter Sanders]] ('''2013'''). ''[https://publikationen.bibliothek.kit.edu/1000039066 Parallel String Sample Sort]''. [https://arxiv.org/abs/1305.1157 arXiv:1305.1157]
* [https://dblp.uni-trier.de/pers/hd/r/Rihani:Hamza Hamza Rihani], [[Peter Sanders]], [https://dblp.uni-trier.de/pers/hd/d/Dementiev:Roman Roman Dementiev] ('''2014'''). ''MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues''. [https://arxiv.org/abs/1411.1209 arXiv:1411.1209]
* [https://dblp.uni-trier.de/pers/hd/m/Maier:Tobias Tobias Maier], [[Peter Sanders]], [https://dblp.uni-trier.de/pers/hd/d/Dementiev:Roman Roman Dementiev] ('''2016'''). ''Concurrent Hash Tables: Fast and General?(!)''. [https://arxiv.org/abs/1601.04017 arXiv:1601.04017]
* [https://dblp.uni-trier.de/pers/hd/m/Maier:Tobias Tobias Maier], [[Peter Sanders]] ('''2017'''). ''Dynamic Space Efficient Hashing''. [https://arxiv.org/abs/1705.00997 arXiv:1705.00997]
* [[Peter Sanders]] ('''2018'''). ''Hashing with Linear Probing and Referential Integrity''. [https://arxiv.org/abs/1808.04602 arXiv:1808.04602]
=External Links=
* [https://en.wikipedia.org/wiki/Peter_Sanders_(computer_scientist) Peter Sanders from Wikipedia]
* [http://algo2.iti.kit.edu/english/sanders.php KIT – ITI Algorithmics II – Members - Peter Sanders]
* [https://www.genealogy.math.ndsu.nodak.edu/id.php?id=185579 Peter Sanders - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
