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.
Peter Sanders [1]

Selected Publications

• 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, CiteSeerX
• Peter Sanders, Jesper Larsson Träff (2006). Parallel Prefix (Scan) Algorithms for MPI. in EuroPVM/MPI 2006, LNCS, pdf
• Kurt Mehlhorn, Peter Sanders (2008). Data Structures and Algorithms: The Basic Toolbox. Springer, ISBN 978-3540779773
• Felix Putze, Peter Sanders, Johannes Singler (2009). Cache-, hash-, and space-efficient bloom filters. ACM Journal of Experimental Algorithmics Vol. 14

External Links

• KIT – ITI Algorithmics II – Members - Peter Sanders

References

1. ^ KIT – ITI Algorithmics II – Members - Peter Sanders
2. ^ Peter Sanders - Publications
3. ^ DBLP: Peter Sanders
4. ^ Richard Karp, Yanjun Zhang (1988). A randomized parallel branch-and-bound procedure. STOC '88

What links here?