Peter Sanders
Revision as of 00:37, 31 January 2020 by GerdIsenberg (talk | contribs)
Peter Sanders [1]
Peter Sanders,
a German computer scientist and professor at Karlsruhe Institute of Technology with former appointment at Max Planck Institute for Computer Science.
His research interests covers algorithm theory, algorithm engineering, parallel processing and communication in networks and solving problems with "irregular" structures, like parallel game tree search.
Contents
Selected Publications
1994 ...
- Peter Sanders (1994). Suchalgorithmen auf SIMD-Rechnern – Weitere Ergebnisse zu Polyautomaten. Diploma thesis, University of Karlsruhe (German)
- Peter Sanders (1994). Massively Parallel Search for Transition-Tables of Polyautomata. Parcella 1994, pdf
- Peter Sanders (1995). Fast priority queues for parallel branch-and-bound. IRREGULAR 1995 [4]
- Peter Sanders (1995). Better Algorithms for Parallel Backtracking. IRREGULAR 1995
- Holger Hopp, Peter Sanders (1995). Parallel Game Tree Search on SIMD Machines. IRREGULAR 1995, pdf
- Peter Sanders (1997). Lastverteilungsalgorithmen für parallele Tiefensuche. Ph.D. thesis, University of Karlsruhe, advisor Roland Vollmar (German)
- Peter Sanders (1998). Tree Shaped Computations as a Model for Parallel Applications. Max Planck Institute for Computer Science, pdf
2000 ...
- Peter Sanders (2000). Fast Priority Queues for Cached Memory. ACM Journal of Experimental Algorithmics, Vol. 5
- Kurt Mehlhorn, Peter Sanders (2003). Scanning Multiple Sequences Via Cache Memory. Algorithmica, Vol. 35, No. 1
- Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis (2005). Space Efficient Hash Tables with Worst Case Constant Access Time. Theory of Computing Systems, Vol. 38, No. 2
- Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo Tolhuizen (2005). Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory, Vol. 51, No. 6, pdf [5]
- Peter Sanders, Jesper Larsson Träff (2006). Parallel Prefix (Scan) Algorithms for MPI. EuroPVM/MPI 2006, pdf
- Kurt Mehlhorn, Peter Sanders (2008). Algorithms and Data Structures: The Basic Toolbox. Springer
- Felix Putze, Peter Sanders, Johannes Singler (2009). Cache-, Hash- and Space-Efficient Bloom Filters. ACM Journal of Experimental Algorithmics, Vol. 14, pdf
2010 ...
- Peter Sanders (2011). Algorithm Engineering. Encyclopedia of Parallel Computing 2011
- Timo Bingmann, Peter Sanders (2013). Parallel String Sample Sort. arXiv:1305.1157
- Hamza Rihani, Peter Sanders, Roman Dementiev (2014). MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues. arXiv:1411.1209
- Tobias Maier, Peter Sanders, Roman Dementiev (2016). Concurrent Hash Tables: Fast and General?(!). arXiv:1601.04017
- Tobias Maier, Peter Sanders (2017). Dynamic Space Efficient Hashing. arXiv:1705.00997
- Peter Sanders (2018). Hashing with Linear Probing and Referential Integrity. arXiv:1808.04602
External Links
- Peter Sanders from Wikipedia
- KIT – ITI Algorithmics II – Members - Peter Sanders
- Peter Sanders - Google Scholar Citations
- Peter Sanders - The Mathematics Genealogy Project
