Treffer: Algorithm Engineering for fundamental Sorting and Graph Problems
Title:
Algorithm Engineering for fundamental Sorting and Graph Problems
Authors:
Contributors:
Sanders, P.
Publisher Information:
KIT-Bibliothek, Karlsruhe
Publication Year:
2014
Collection:
KITopen (Karlsruhe Institute of Technologie)
Subject Terms:
Document Type:
Dissertation
doctoral or postdoctoral thesis
File Description:
application/pdf
Language:
English
Relation:
DOI:
10.5445/IR/1000042377
Availability:
Rights:
KITopen License, https://publikationen.bibliothek.kit.edu/kitopen-lizenz ; info:eu-repo/semantics/openAccess
Accession Number:
edsbas.A9BAB57
Database:
BASE
Weitere Informationen
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.