Home | deutsch  | Legals | Data Protection | Sitemap | KIT


This project addresses algorithm engineering for basic algorithms and data structures that are the most important building blocks for many computer applications — sorting, searching, graph traversal,. . . . Although this topic is as old as computers science itself, many interesting new results have appeared in recent years and many gaps between theory and practice remain. In particular, many interesting approaches have not been thoroughly tried experimentally. Ever more complex hardware with memory hierarchies and several types of parallel processing requires refined models, new algorithms, and efficient implementations. We plan to incorporate the most successful implementations into reusable software libraries such as the the C++ STL.

Excerpt from the proposal

Specific Topics

See publications.

Related Work of the Group

People / Contact

Peter Sanders, Proposer
Vitaly Osipov, Scientific Staff
, Scientific Staff

Title Author(s) Conference

M. Rahn, P. Sanders, J. Singler

International Conference on Data Engineering (ICDE)

A. Beckmann, R. Dementiev, J. Singler

IEEE International Parallel & Distributed Processing Symposium (IPDPS)

V. Osipov, P. Sanders, J. Singler


L. Frias, J. Singler, P. Sanders

International Workshop on Multi-Core Computing Systems (MuCoCoS) 2008
L. Frias, J. Singler
Workshop on Highly Parallel Processing on a Chip (HPPC)
J. Singler, P. Sanders, F. Putze
Euro-Par 2007
R. Dementiev, L. Kettner, P. Sanders 13th Ann. European Symposium on Algorithms (ESA)