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. || toc =Selected Publications=
 * Home * People * Peter Sanders**
 * [[image:sm_sanders.jpg link="http://algo2.iti.kit.edu/english/sanders.php"]] ||~ || **Peter Sanders**,
 * Peter Sanders ||~ ||^ ||
 * Peter Sanders (**1995**). //Fast priority queues for parallel branch-and-bound//. [|IRREGULAR 1995]
 * 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= =What links here?= include page="Peter Sanders" component="backlinks" limit="40"
 * Up one level**