KIT | KIT-Bibliothek | Impressum | Datenschutz

Algorithm Engineering for fundamental Sorting and Graph Problems

Osipov, Vitaly

Abstract:
Fundamental Algorithms build a basis knowledge for every computer science undergraduate or a professional programmer. It is a set of basic techniques one can find in any (good) coursebook on algorithms and data structures. In this thesis we try to close the gap between theoretically worst-case optimal classical algorithms and the real-world circumstances one face under the assumptions imposed by the data size, limited main memory or available parallelism.

Open Access Logo


Volltext §
DOI: 10.5445/IR/1000042377
Coverbild
Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Publikationstyp Hochschulschrift
Jahr 2014
Sprache Englisch
Identifikator urn:nbn:de:swb:90-423777
KITopen-ID: 1000042377
Verlag KIT, Karlsruhe
Abschlussart Dissertation
Fakultät Fakultät für Informatik (INFORMATIK)
Institut Institut für Theoretische Informatik (ITI)
Prüfungsdaten 14.04.2014
Referent/Betreuer Prof. P. Sanders
Schlagworte Algorithm, Engineering, Sorting, Graph
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page